Conflict-Aware Scheduling for Dynamic Content Applications

4th USENIX Symposium on Internet Technologies and Systems

Cristiana Amza ; Alan L. Cox ; Willy Zwaenepoel

Others  :  http://www.usenix.org/publications/library/proceedings/usits03/tech/full_papers/amza/amza.pdf
PID  :  8898

来源: CEUR

【 摘 要 】

We present a new lazy replication technique, suitablefor scaling the back-end database of a dynamic contentsite using a cluster of commodity computers. Our technique,called conflict-aware scheduling, provides boththroughput scaling and 1-copy serializability. It hasgenerally been believed that this combination is hardto achieve through replication because of the growth ofthe number of conflicts. We take advantage of the presencein a database cluster of a scheduler through whichall incoming requests pass. We require that transactionsspecify the tables that they access at the beginningof the transaction. Using that information, a conflictawarescheduler relies on a sequence-numbering schemeto implement 1-copy serializability, and directs incomingqueries in such a way that the number of conflicts is reduced.