Abstract
In both database transaction management and parallel programming, parallel execution of operations is one of the most essential features. Although they look quite different, we will show that many important similarities exist. As a result of a more careful comparison we will be able to point out that recent progress in database transaction management theory in the field of composite stack schedules can improve the degree of parallelism in databases as well as in parallel programming. We will use an example from numerical algorithms and will demonstrate that in principle more parallelism can be achieved.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Alonso, S. Blott, A. Fessler, and H.-J. Schek. Correctness and parallelism in composite systems. In Proc. of the 16th Symp. on Principles of Database Systems (PODS’97), Tucson, Arizona, May 1997.
G. Alonso, A. Feßler, G. Pardon, and H.-J. Schek. Transactions in stack, fork, and join composite systems. In 7th International Conference on Database Theory (ICDT), Jerusalem, Israel, Jan. 1999.
S. Brawer. Introduction to Parallel Programming. Academic Press, 1989.
A. Feßler. Eine verallgemeinerte Transaktionstheorie für Datenbank-und Nicht-datenbankaufgaben (to appear). Dissertation, Department of Computer Science, ETH Zürich, 1999.
G. Weikum. Principles and Realisation Strategies of Multilevel Transaction Management. ACM Transactions on Database Systems, 16(1):132, March 1991.
C.-A. Wichert, A. Fent, and B. Freitag. How to execute ULTRA transactions. Technical Report MIP-9812, Universität Passau (FMI), 1998.
H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computers. Addison-Wesley, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feßler, A., Schek, HJ. (1999). A Generalized Transaction Theory for Database and Non-database Tasks. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_62
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive