Transactional scheduling for read-dominated workloads |
| |
Authors: | Hagit Attiya Alessia Milani |
| |
Affiliation: | 1. Technion, Israel;2. Labri, University of Bordeaux 1-IPB, France |
| |
Abstract: | The transactional approach to contention management guarantees atomicity by aborting transactions that may violate consistency. A major challenge in this approach is to schedule transactions in a manner that reduces the total time to perform all transactions (the makespan), since transactions are often aborted and restarted. The performance of a transactional scheduler can be evaluated by the ratio between its makespan and the makespan of an optimal, clairvoyant scheduler that knows the list of resource accesses that will be performed by each transaction, as well as its release time and duration. |
| |
Keywords: | Transactional memory Scheduling Competitive analysis Read-dominated workload |
本文献已被 ScienceDirect 等数据库收录! |