A measure of transaction processing power
Datamation
ACM SIGCOMM Computer Communication Review
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The Case for Application-Specific Benchmarking
HOTOS '99 Proceedings of the The Seventh Workshop on Hot Topics in Operating Systems
Gradient clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Scalable SQL and NoSQL data stores
ACM SIGMOD Record
YCSB++: benchmarking and performance debugging advanced features in scalable table stores
Proceedings of the 2nd ACM Symposium on Cloud Computing
Gossip-based clock synchronization for large decentralized systems
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
For better or worse, benchmarks shape a field: technical perspective
Communications of the ACM
Communications of the ACM
Communications of the ACM
Cache augmented database management systems
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Expedited rating of data stores using agile data loading techniques
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A comparison of two physical data designs for interactive social networking actions
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Zipfian distribution is used extensively to generate workloads to test, tune, and benchmark data stores. This paper presents a decentralized implementation of this technique, named D-Zipfian, using N parallel generators to issue requests. A request is a reference to a data item from a fixed population of data items. The challenge is for each generator to reference a disjoint set of data items. Moreover, they should finish at approximately the same time by performing work proportional to their processing capability. Intuitively, D-Zipfian assigns a total probability of 1/N to each of the N generators and requires each generator to reference data items with a scaled probability. In the case of heterogeneous generators, the total probability of each generator is proportional to its processing capability. We demonstrate the effectiveness of D-Zipfian using empirical measurements of the chi-square statistic.