Sciweavers

62 search results - page 2 / 13
» High Throughput Escrow Algorithms for Replicated Databases
Sort
View
EUROSYS
2007
ACM
15 years 6 months ago
Tashkent+: memory-aware load balancing and update filtering in replicated databases
We present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets ...
Sameh Elnikety, Steven G. Dropsho, Willy Zwaenepoe...
BMCBI
2011
14 years 4 months ago
PheMaDB: A solution for storage, retrieval, and analysis of high throughput phenotype data
Background: OmniLog™ phenotype microarrays (PMs) have the capability to measure and compare the growth responses of biological samples upon exposure to hundreds of growth condit...
Wenling E. Chang, Keri Sarver, Brandon W. Higgs, T...
EUROSYS
2006
ACM
15 years 6 months ago
Tashkent: uniting durability with transaction ordering for high-performance scalable database replication
In stand-alone databases, the two functions of ordering the transaction commits and making the effects of transactions durable are generally performed in one action, namely in the...
Sameh Elnikety, Steven G. Dropsho, Fernando Pedone
DSN
2011
IEEE
13 years 9 months ago
High performance state-machine replication
Computer systems are usually made fault tolerant through replication. By replicating a service on multiple servers we make sure that if some replicas fail, the service can still b...
Parisa Jalili Marandi, Marco Primi, Fernando Pedon...
ICDE
2006
IEEE
118views Database» more  ICDE 2006»
15 years 3 months ago
Evaluation of Placement and Access Asignment for Replicated Object Striping
The number of stored objects that should be targets of high throughput retrieval, such as multimedia stream objects, is increasing recently. To implement a high throughput storage...
Makoto Kataigi, Dai Kobayashi, Tomohiro Yoshihara,...