Jun 9, 2005 · Shared-nothing parallel transaction processing (TP) systems have great potential to serve the ever-increasing demands for high transaction ...
We observed that for the shared-nothing parallel TP system, this negative effect of 2PL can be alleviated significantly by scheduling transactions judiciously.
A transaction scheduling algorithm called SCST (Synchronizing Completion of Sub-Transactions) is proposed to reduce the data contention and thus to improve the ...
In this paper, a new transaction scheduling algorithm called FCFSP (FCFS with Priority) is proposed thereby. In order to study the performance of transaction ...
People also ask
Why is scheduling important in parallel computing?
What is scheduling in parallel and distributed computing?
The purpose of this paper is to study the task scheduling problem of task sets on multiprocessor systems. In the task sets there are parallel tasks and ...
One of the goals of this chapter is to clarify the differences among scheduling algorithms, and their application domains. In general, during the scheduling of ...
Document information ; Title : An Effective Scheduling Algorithm for Parallel Transaction Processing Systems ; Contributors: Li, J. (author) / Li, K. (author) / ...
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to ...
In this work, we show that transaction processing systems can dramatically improve throughput by systematically exploring the schedule space, proactively ...
In this paper the major research results in deterministic parallel-machine scheduling theory will pass a survey.