A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Characterizing and optimizing TPC-C workloads on large-scale systems using SSD arrays
2016
Science China Information Sciences
First, we propose an approach based on SmallFile table space to organize the test data in a round-robin method on all of the disk array partitions; this can make full use of the underlying disk arrays. ...
Transaction processing performance council benchmark C (TPC-C) is the de facto standard for evaluating the performance of high-end computers running on-line transaction processing applications. ...
In the second storage environment, we used our proposed SmallFile table space method to manage the underlying disk arrays. Each disk array was partitioned into a number of 8 GB blocks. ...
doi:10.1007/s11432-015-5383-x
fatcat:xhffo2d2ojaflazxgce5f67yya
Flexible Architecture of Disk Array
1997
Journal of the Magnetics Society of Japan
Redundant Array of Independent Disks (RAID) IS the most etlicient way to avoid the bottleneck problem between I/O subsystem's performance and the CPU processing power. ...
Two kinds of special structures, RAID_table and RAID_map are proposed in order to implement FlexArch. ...
of transaction processing. ...
doi:10.3379/jmsjmag.21.s2_351
fatcat:4rb73lkl7nbwxpt27fvmvwqts4
Parallel query processing in shared disk database systems
1993
SIGMOD record
We also outline necessary extensions for transaction management (concurrency/coherency control, logging/recovery) to support intratransaction parallelism in the Shared Disk environment. 41-1 41·2 Parallel ...
In panicular, the shared memory can become a performance bottleneck thereby limiting the scalability of the architecture. ...
Hence, SD is better positioned than SN or SE to utilize disk arrays for parallel query processing. Of course, SD can also use conventional disk farms instead of disk arrays. ...
doi:10.1145/166635.166649
fatcat:ky6omhxokjexffwmbx4is4x34e
Availability in the Sprite distributed file system
1991
ACM SIGOPS Operating Systems Review
Mechanisms used for reliability can be inappropriate in systems with the primary goal of performance, and some availability-oriented methods using replicated hardware or processes cost too much for these ...
In the Sprite environment, tolerating faults means recovering from them quickly. ...
processing environments. ...
doi:10.1145/122120.122131
fatcat:t3au4z4iqfdqlggjhzrl6mqovy
Availability in the Sprite distributed file system
1990
Proceedings of the 4th workshop on ACM SIGOPS European workshop - EW 4
Mechanisms used for reliability can be inappropriate in systems with the primary goal of performance, and some availability-oriented methods using replicated hardware or processes cost too much for these ...
In the Sprite environment, tolerating faults means recovering from them quickly. ...
processing environments. ...
doi:10.1145/504136.504151
dblp:conf/sigopsE/BakerO90
fatcat:c3tjrd7nurh3pa5go5mr45oqri
Parity Data De-Duplication in All Flash Array-Based OpenStack Cloud Block Storage
2016
IEICE transactions on information and systems
Because these kinds of cloud systems require high performance and reliable storage, the use of flash-based Redundant Array of Independent Disks (RAID) will increase. ...
Unlike the traditional data deduplication method, it only removes parity data, which will be stored in the parity disks of the all flash array. ...
But the proposed parity deduplication method shows 95% and 96% of the write performance in the same environment. ...
doi:10.1587/transinf.2016edl8006
fatcat:nzelrnsirvh7tavetmleazniny
Reducing disk power consumption in servers with DRPM
2003
Computer
simulates a set of users who perform transactions such as placing an order and checking its status. • TPC-H, an online application-processing benchmark, captures decision-support transactions on a database ...
Figure 1 plots the breakdown of the total I/O subsystem energy for three RAID configurations against two common transaction-processing benchmarks: • TPC-C, an online transaction-processing benchmark, ...
Sudhanva Gurumurthi is a PhD candidate in the ...
doi:10.1109/mc.2003.1250884
fatcat:x3wl2rebmfcufj5rnvjzvtqeua
Redundant Array of Inexpensive Disks (RAID): Technology Description, Characterizations, Comparisons, Usage and Cost Benefits
1994
Journal of the Magnetics Society of Japan
The disk arrays can be configured differently to provide different levels of operational capabilities, each providing special advantages in reliability and data availability, speed and economy. ...
They were investigating the use of an array of small capacity, inexpensive personal computer direct access storage devices (DASD) managed by a special type of a controller. as an alternative to the single ...
and performance) common at mainframe levels through aggregating the data rates of several devices in the disk array. ...
doi:10.3379/jmsjmag.18.s1_53
fatcat:u3ngsyjkrjebpkou7rslweilqu
A performance evaluation of distributed database architectures
2012
Concurrency and Computation
Although a number of distributed database architectures are available for choice, there is a lack of an in-depth understanding of the performance characteristics of these database architectures in a comparison ...
In centralized database architecture (CA), data processing support is provided by one or a cluster of computers, generally large computers, located in a central data processing facility. ...
Each array list contains all transactions of each type that had been run in the benchmark process. ...
doi:10.1002/cpe.2891
fatcat:v2xm5fbmqna5nkb4svj6cr6l3u
Storage performance-metrics and benchmarks
1993
Proceedings of the IEEE
We first high fight the technology trends taking place in storage system, such as disk and tape evolution, disk arrays, and solid-state disks. ...
In this paper, we discuss the metrics and benchmarks used in storage performance evaluation. ...
Most current VO benchmarks do not scale the number of processes issuing YO, and hence are unable to properly stress disk arrays. ...
doi:10.1109/5.236192
fatcat:stpvfpirgfa7vidfwhx77hn6qi
Measurement of Energy Performances for General-Structured Servers
2017
IOP Conference Series: Earth and Environment
Pilot tests are conducted to assess the energy performance testing methods of servers. The findings of the tests are discussed in the paper. ...
Energy consumption of servers in data centers increases rapidly along with the wide application of Internet and connected devices. ...
Acknowledgment Supported by Project 2014BAK02B06 of National Science and Technology Support Program, support by Project 2015424050 of Special Fund for quality control Research in the Public Interest. ...
doi:10.1088/1755-1315/94/1/012066
fatcat:edyvl7cjifd47esftln7cfxhwq
Distributed RAID A New Multiple Copy Algorithm
[chapter]
2009
High Performance Mass Storage and Parallel I/O
As such, this algorithm may be attractive in various multicopy environments as well as in disaster recovery. ...
All previous multicopy algorithms require additional space for redundant information equal to the size of the object being replicated. ...
In a cautious RAID or RAID environment we assume a MTTR of one hour because spare disks exist in the array and one need only reconstruct a disk in background. ...
doi:10.1109/9780470544839.ch6
fatcat:ssor5egfqbemrisvongh5dohha
Disk system architectures for high performance computing
1989
Proceedings of the IEEE
In addition, new developments driven by advances in smalldiameter (5.25-in and 3.5-in) disk drives, promise very high 110 bandwidth if large numbers of devices can be organized into arrays of disks. ...
In this paper we review the state of the art in disk devices and 110 controllers, and will describe new approaches for very highperformance /IO based on redundant arrays of inexpensive disks (RAIDS). ...
ACKNOWLEDCMEN~ We wish to thank our colleagiies o n the RAID project for theircontributionstothework ri:ported in this paper.These ...
doi:10.1109/5.48827
fatcat:dkl7mekauve7nblajgnhb53opm
Write-Optimized B-Trees
[chapter]
2004
Proceedings 2004 VLDB Conference
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. ...
of indirection for locating B-tree nodes on disk. ...
Introduction In a typical transaction-processing environment, the dominant I/O patterns are reads of individual pages based on index look-ups and writes of updated versions of those pages. ...
doi:10.1016/b978-012088469-8.50060-7
dblp:conf/vldb/Graefe04
fatcat:2qg32qrzkneorlbshbpf4vfc7u
Write-Optimized B-Trees
[chapter]
2004
Proceedings 2004 VLDB Conference
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. ...
of indirection for locating B-tree nodes on disk. ...
Introduction In a typical transaction-processing environment, the dominant I/O patterns are reads of individual pages based on index look-ups and writes of updated versions of those pages. ...
doi:10.1016/b978-012088469-8/50060-7
fatcat:5pjp64q25jhslh3uvxtrdkzfua
« Previous
Showing results 1 — 15 out of 10,612 results