ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems

ProcSimity is a software tool that supports research in processor allocation and scheduling for highly parallel systems. ProcSimity's multicomputer simulator supports experimentation with selected allocation and scheduling algorithms on architectures with a range of network topologies and for several current routing and flow control mechanisms. Message-passing can be simulated in detail at the flit level or at a higher level of modeling. Our tool supports both stochastic job streams as well as communication patterns from actual parallel applications, including several of the NAS parallel benchmarks. ProcSimity's visualisation and performance analysis tool allows the user to view a dynamic animation of the selected algorithms as well as a variety of system and job level performance metrics. ProcSimity has been successfully used in experiments investigating the feasibility of non-contiguous processor allocation in meshes and k-ary n-cubes.<<ETX>>

[1]  Phillip Krueger,et al.  ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..

[2]  J. Robert Jump,et al.  Cross-profiling as an efficient technique in simulating parallel computer systems , 1989, [1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference.

[3]  Sandhya Dwarkadas,et al.  Efficient Simulation of Parallel Computer Systems , 1991, Int. J. Comput. Simul..

[4]  Bella Bose,et al.  Contiguous and Non-Contiguous Processor Allocation Algorithms for kappa-cubes , 1995, ICPP.

[5]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[6]  Bill Nitzberg,et al.  Non-contiguous processor allocation algorithms for distributed memory multicomputers , 1994, Proceedings of Supercomputing '94.

[7]  Nian-Feng Tzeng,et al.  An efficient submesh allocation strategy for mesh computer systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[8]  B. Bose,et al.  A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[9]  Melanie L. Fulgham.  Performance of Chaos and Oblivious Routers Under Non-uniform Traffic , 1993 .

[10]  Yahui Zhu,et al.  Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..

[11]  Vipin Chaudhary,et al.  Subcube allocation strategies in a k-ary n-cube , 1993 .

[12]  Michael T. Heath,et al.  Visualizing the performance of parallel programs , 1991, IEEE Software.

[13]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[14]  V. M. Lo,et al.  METRICS: a tool for the display and analysis of mappings in message-passing multicomputers , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..