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 do a decrease in system performance. This research focuses on controlling shared resource contention for achieving high capacity and scalability in multiprocessor based applications that include telephone switches and real time databases. Both reengineering of existing code as well as appropriate scheduling of the processes are two viable methods for controlling memory contention. Emphasis is placed on the second approach. Based on analytic models, three different scheduling approaches are compared. The numerical results obtained from the model provide insights into system behavior and highlight the important attributes of each strategy. A hybrid approach that combines the good attributes of a number of these strategies is proposed and analyzed. The results of this research are useful mainly to designers of software for multiprocessor based telecommunication and other embedded systems.

Additional Metadata
Persistent URL dx.doi.org/10.1109/ISPASS.2000.842292
Conference IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2000
Citation
Majumdar, S. (2000). Performance scalability in multiprocessor systems with resource contention. Presented at the IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2000. doi:10.1109/ISPASS.2000.842292