Abstract
Time-sharing operating systems may delay application processing of incoming messages because other processes are scheduled when the messages arrive. In this paper, we present a simple adjustment to application polling behavior that reduces this effect when the parallel process competes with CPU-intensive sequential jobs. Our results showed that moderate improvement might be achieved. However, the effectiveness of the approach is highly application-dependent.
Preview
Unable to display preview. Download preview PDF.
References
P. Keleher. The Relative Importance of Concurrent Writers and Weak Consistency Models. in Proceedings of the 16th International Conference on Distributed Computing Systems. 199691-99. Hong Kong: IEEE.
A.C. Dusseau, R.H. Arpaci, and D.E. Culler. Effective Distributed Scheduling of Parallel Workloads. in Sigmetrics’96 Conference on the Measurement and Modeling of Computer Systems. 1996.
P.G. Sobalvarro, et al. Dynamic coscheduling on workstation clusters. in Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing. March 1998.
S.C. Woo, et al. The SPLASH-2 Programs: Characterization and Methodological Considerations. in Proceedings of the 22nd Annual International Symposium on Computer Architecture. June 199524-37. Santa Margherita Ligure, Italy.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Thitikamol, K., Keleher, P. (1999). Communication-intensive parallel applications and non-dedicated clusters of workstations. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097935
Download citation
DOI: https://doi.org/10.1007/BFb0097935
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive