Abstract
In this paper, we have demonstrated how the existing programming environments, tools and middleware could be used for the study of execution performance of parallel and sequential applications on a non-dedicated cluster. A set of parallel and sequential benchmark applications selected for and used in the experiments were characterized, and experiment requirements shown.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arpaci, R.H., Dusseau, A.C., Vahdat, A.M., Liu, L.T., Anderson, T.E., Patterson, D.A.: The Interaction of Parallel and Sequential Workloads on a Network of Workstations. In: Proceedings of 1995 ACM Joint International Conference on Measurement and Modeling of Computing Systems, May 1995, pp. 267–278 (1995)
Acharya, A., Edjlali, G., Saltz, J.: The Utility of Exploiting Idle Workstations for Parallel Computation. In: Proceedings of 1997 ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems, May 1997, pp. 225–236 (1997)
Anglano, C.: A Comparative Evaluation of Implicit Coscheduling Strategies for Networks of Workstations. In: Proceedings of 9th International Symposium on High Performance Distributed Computing (HPDC9), August 2000, pp. 221–228 (2000)
Burns, G., Daoud, R., Vaigl, J.: LAM: An Open Cluster Environment for MPI. In: Proceedings of Supercomputing Symposium, University of Toronto, pp. 379–386 (1994)
Becker, W.: Dynamic Balancing Complex Workload in Workstation Networks - Challenge, Concepts and Experience. In: Proceedings High Performance Computing and Networking (HPCN). Europe Lecture Notes on Computer Science (LNCS), pp. 407–412 (1995)
Barak, A., Guday, S., Wheeler, R.G.: The MOSIX Distributed Operating System, Load Balancing for UNIX. Springer, Heidelberg (1993)
BYTE’s UnixBench. The BYTE’s Unix Benchmark Suite (June 2004), http://www.tux.org/pub/tux/niemi/unixbench
Chuang, P.J., Tzeng, N.F.: A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers. IEEE Transactions on Computers 41(4), 467–479 (1992)
The MPI Forum. MPI: a message passing interface. In: Proceedings of the 1993 Conference on Supercomputing, pp. 878–883 (1993)
Faraj, A., Yuan, X.: Communication Characteristics in the NAS Parallel Benchmarks. In: Proceedings of the 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002) (November 2002)
Goscinski, A.M.: Distributed Operating Systems, The Logical Design. Addison-Wesley, Sydney (1991)
Goscinski, A.M., Wong, A.K.L.: Performance Evaluation of the Concurrent Execution of NAS Parallel Benchmarks with BYTE Sequential Benchmarks on a Cluster. In: Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS 2005), Fukuoka, Japan (July 2005)
The LAM/MPI Homepage, http://www.lam-mpi.org (lasted access: June 2004)
Lai, T.H., Sahni, S.: Anomalies in Parallel Branch-and-Bound Algorithms. Communications of the ACM 27(6), 594–602 (1984)
NAS Parallel Benchmarks, http://www.nas.nasa.gov/Software/NPB/ (November 2004)
The openMosix Homepage, http://openmosix.sourceforge.net (June 2004)
Strazdins, P., Uhlmann, J.: Local Scheduling out-performs Gang Scheduling on a Beowulf Cluster. Technical Report TR-CS-04-01, ANU, Canberra (2004)
Subhlok, J., Venkataramaiah, S., Singh, A.: Characterizing NAS Benchmark Performance on Shared Heterogeneous Networks. In: 11th International Heterogeneous Computing Workshop (April 2002)
Tandiary, F., Kothari, S.C., Dixit, A., Anderson, E.W.: Batrun: Utilizing Idle Workstations for Large-scale Computing. IEEE Parallel and Distributed Technology 4(2), 41–48 (1996)
Verrall, L.: MPI-Povray: Distributed Povray Using MPI Message Passing, http://www.verrall.demon.co.uk/mpipov
Wong, F.C., Arpaci-Dusseau, A.C., Culler, D.E.: Building MPI for Multi-Programming Systems using Implicit Information. In: Proceedings of the 6th European PVM/MPI User’s Group Meeting, pp. 215–222 (1999)
Wong, A.K.L., Goscinski, A.M.: Scheduling of a Parallel Computation-Bound Application and Sequential Applications Executing Concurrently on a Cluster – A Case Study. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol. 3358, pp. 648–655. Springer, Heidelberg (2004)
Zhu, Y.: Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers. Journal of Parallel and Distributed Computing 16(4), 328–337 (1992)
Zhou, B.B., Qu, X., Brent, R.P.: Effective Scheduling in a Mixed Parallel and Sequential Computing Environment. In: Proceedings of the 6th Euromicro Workshop of Parallel and Distributed Processing, January 1998, pp. 32–37 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wong, A.K.L., Goscinski, A.M. (2005). Execution Environments and Benchmarks for the Study of Applications’ Scheduling on Clusters. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_23
Download citation
DOI: https://doi.org/10.1007/11564621_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)