Close category search window
 

Scheduling batch transactions on shared-nothing parallel database machines: effects of concurrency and parallelism

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ohmori, T. ; Dept. of Electr. Eng., Tokyo Univ., Japan ; Kitsuregawa, M. ; Tanaka, H.

Concurrency-control scheduling of batch transactions on shared-nothing (or loosely-coupled) multiprocessor database machines is discussed. Various schedulers are tested for these batch transactions to examine how well they perform when both intertransaction parallelism and intratransaction parallelism are limited. New schedulers designed for batch transaction processing are outlined which use a new tool called a weighted transaction-precedence graph (WTPG). Simulation results show that two new schedulers (globally and locally optimized WTPG schedulers) are the best performers under various workloads

Published in:
Data Engineering, 1991. Proceedings. Seventh International Conference on

Date of Conference: 8-12 Apr 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.