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.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-540-46642-0_21
Citation
Majumdar, S. (1999). Scheduling strategies for controlling resource contention on multiprocessor systems. doi:10.1007/978-3-540-46642-0_21