- Sponsor:
- sigops
No abstract available.
Proceeding Downloads
Comparing high-performance multi-core web-server architectures
In this paper, we study how web-server architecture and implementation affect performance when trying to obtain high throughput on a 4-core system servicing static content. We focus on static content as a growing numbers of servers are dedicated to ...
Methodologies for generating HTTP streaming video workloads to evaluate web server performance
Recent increases in live and on-demand video streaming have dramatically changed the Internet landscape. In North America, Netflix alone accounts for 28% of all and 33% of peak downstream Internet traffic on fixed access links, with further rapid growth ...
On extracting session data from activity logs
Activity logs from large-scale systems facilitate the study of user behavior, which can be used to improve and tune the user experience. However, the available data often lacks important elements such as the identification of user sessions. Previous ...
On open nesting in distributed transactional memory
Distributed Transactional Memory (DTM) is a recent but promising model for programming distributed systems. It aims to present programmers with a simple to use distributed concurrency control abstraction (transactions), while maintaining performance and ...
Optimizing indirect branches in a system-level dynamic binary translator
A dynamic binary translator (DBT) is a runtime system that translates binary code on the fly, for example to emulate the execution of the binary code on a processor with a different instruction set. One of the major sources of the overhead is the ...
Improving application responsiveness with the BFQ disk I/O scheduler
BFQ (Budget Fair Queueing) is a production-quality, proportional-share disk scheduler with a relatively large user base. Part of its success is due to a set of simple heuristics that we added to the original algorithm about one year ago. These ...
An experimental evaluation of real-time DVFS scheduling algorithms
We implement and experimentally evaluate the timeliness and energy consumption behaviors of fourteen Real-Time Dynamic Voltage and Frequency Scaling (RT-DVFS) schedulers on two hardware platforms. The schedulers include CC-EDF, LA-EDF, REUA, DRA, and ...
Scheduling processing of real-time data streams on heterogeneous multi-GPU systems
Processing vast numbers of data streams is a common problem in modern computer systems and is known as the "online big data problem." Adding hard real-time constraints to the processing makes the scheduling problem a very challenging task that this ...
GPUstore: harnessing GPU computing for storage systems in the OS kernel
Many storage systems include computationally expensive components. Examples include encryption for confidentiality, checksums for integrity, and error correcting codes for reliability. As storage systems become larger, faster, and serve more clients, ...
Towards exitless and efficient paravirtual I/O
Virtualization is a prominent technology used in data centers around the world. While many kinds of workloads can run at near-native performance even when virtualized, I/O intensive workloads still suffer from high overhead precluding the use of ...
BVSSD: build built-in versioning flash-based solid state drives
Time-traveling ability, which enables storage state to be reverted to any previous timepoints, is a highly desirable functionality in modern storage systems to ensure storage continuity. Continuous Data Protection (CDP) is a typical time-traveling ...
Analytic modeling of SSD write performance
Solid state drives (SSDs) update data by writing a new copy, rather than overwriting old data, causing prior copies of the same data to be invalidated. These writes are performed in units of pages, while space is reclaimed in units of multi-page erase ...
SAC: rethinking the cache replacement policy for SSD-based storage systems
Solid-state drives (SSDs) are widely used in storage systems. However, algorithms adopted by existing operating systems generally consider the underlying devices as hard disks, and thus are rarely optimized for SSDs. In this paper, we focus on a ...
MyCassandra: a cloud storage supporting both read heavy and write heavy workloads
A cloud storage with persistence shows solid performance only with a read heavy or write heavy workload. There is a trade-off between the read-optimized and write-optimized design of a cloud storage. This is dominated by its storage engine, which is a ...
Reducing impact of data fragmentation caused by in-line deduplication
Deduplication results inevitably in data fragmentation, because logically continuous data is scattered across many disk locations. In this work we focus on fragmentation caused by duplicates from previous backups of the same backup set, since such ...
Understanding data survivability in archival storage systems
Preserving data for a long period of time in the face of faults, large and small, is crucial for designing reliable archival storage systems. However, the survivability of data is different from the reliability of storage because typically, data are ...
Insights for data reduction in primary storage: a practical analysis
There has been increasing interest in deploying data reduction techniques in primary storage systems. This paper analyzes large datasets in four typical enterprise data environments to find patterns that can suggest good design choices for such systems. ...
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SYSTOR '23 | 30 | 12 | 40% |
SYSTOR '22 | 41 | 12 | 29% |
SYSTOR '21 | 63 | 18 | 29% |
SYSTOR '16 | 49 | 16 | 33% |
SYSTOR '13 | 49 | 20 | 41% |
SYSTOR '11 | 53 | 16 | 30% |
Overall | 285 | 94 | 33% |