Scheduling algorithms performance with the pSystem parallel programming environment
The efficiency of scheduling algorithms is essential in order to attain optimal performances from parallel programming systems. In this paper we use a portable parallel programming environment we have implemented, the pSystem, to evaluate and compare the performance of various scheduling algorithms on shared memory parallel machines.
Unable to display preview. Download preview PDF.
- [BS92]Buhr, P.A., and Stroobosscher, R.A.: ΜC++ Annotated Reference Manual (Version 3.4.4), Univ. of Waterloo, Canada, Aug. 1992.Google Scholar
- [BL92]Butler, R., and Lusk, E.: User's Guide to the p4 Programming System, Argonne National Lab., TR ANL-92/17, Oct. 1992.Google Scholar
- [ELZ86]Eager, D.L., Lazowska, E.D., Zahorjan, J.: Adaptative Load Sharing in Homogeneous Distributed Systems, IEEE Trans. on Software Engineering, Vol. SE-12, No. 5, May, 1986.Google Scholar
- [SL93]Silva, F. and Lopes L.: pSystem: a Portable Parallel Programming System for Shared Memory Multiprocessors, VECPAR'93, Porto, Sept. 1993.Google Scholar