Abstract
Multiple processes may contend for shared resources such as variables stored in the shared memory of a multiprocessor system. Mechanisms required to preserve data consistency on such systems often lead to a decrease in system performance. This research focuses on scheduling policies that control shared resource contention and achieve high capacity and scalability in multiprocessor-based applications that include telephone switches and real-time databases. Based on analytic models three different scheduling approaches are analyzed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dandamudi, D., Eager, D.L.: Hot-Spot Contention in Binary Hypercube Networks. IEEE Trans. on Computers 41(2) (February 1992)
Drwiega, T.: Shared Memory Contention and its Impact on Multi-Processor Call Control Throughput. In: Proc. 15th International Teletraffic Congress, pp. 22–27 (June 1997)
Feitelson, D.: A Survey of Scheduling in Multiprogrammed Parallel Systems, Research Report RC19790 (87657), IBM T.J. Watson Research Center, New York (1994)
Feitelson, D.: Packing Schemes for Gang Scheduling. In: Job Schedulmg Strategies for Parallel Processing. LNCS, Springer, Heidelberg (1996)
Liu, M.: ”—” M. Eng. Thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, CANADA, K1S 5B6 (January 2000) (expected)
Majumdar, S.: Controlling Resource Contention on Multiprocessors: a Scheduling-Based Approach, Technical Report, Department of Systems and Computer Engineering, Carleton University, Ottawa, CANADA, K1S 5B6 (September 1999)
Majumdar, S., Streibel, D., Beninger, B., Carroll, B., Verma, N., Liu, M.: Controlling Memory Contention on a Scalable Multiprocessor-Based Telephone Switch. In: Proc. ACM SIGMETRICS 1999 Conference, Atalanta, pp. 228–229 (May 1999) (extended abstract)
Newell, T.E., Baker, B.: Shared memory Control Algorithm For Mutual Exclusion and Rollback. Nortel Networks Patent (1996) (pending)
Singhal, M., Shivaratri, N.G.: Advanced Concepts in Operating Systems. McGraw-Hill, New York (1994)
Woodside, C.M., Monforton, G.G.: Fast Allocation of Processes in Distributed and Parallel Systems. IEEE Trans. on Parallel and Distributed Systems 4(2), 164–174 (1993)
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
Majumdar, S. (1999). Scheduling Strategies for Controlling Resource Contention on Multiprocessor Systems. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive