Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: High Performance Computing (HPC) job performance can vary because of location in the HPC system interconnect. Contiguous and compact allocations of compute nodes for parallel jobs is ideal but infeasible once other jobs have been placed. Reasonable performance of parallel jobs has been achieved with non-contiguous job placement in 3D-torus HPC systems using allocation strategies based on an ordered, one-dimensional sequence of nodes. Ordering of this list is an inexpensive way to incorporate topological information into the placement decision. With several orderings from which to choose - and others that could be created - what is the basis for choosing one ordering over others? Can the choice be made with out expensive, time-consuming benchmarks?   A method is described in this paper for the evaluation of node orderings for grid and torus interconnects based on a measure of job compactness at locations throughout the ordering. Several node orderings are evaluated for actual HPC systems across three sizes. Results suggest visually compelling guidance on the choice of node ordering. The choice is dependent not only on system size but may also be dependent on typical job sizes. Some orderings can be seen to be a consistently poor choice regardless of job size; most orderings are seen to be better only for a range of job sizes. Rarely an ordering is consistently better over the full range of job sizes - but only for a certain size and shape of system interconnect. Finally, the various node orderings re compared against a sequence of placements from a month of actual use on a large HPC system. Indications are that this evaluation method provides a cost-effective way to evaluate orderings and thereby provide generally improved job performance on HPC systems.
['Carl Albing']
I am writing a research paper on a idea Characterizing node orderings for improved performance
[{"from": "human", "value": "I am writing a research paper on a idea Characterizing node orderings for improved performance"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: High Performance Computing (HPC) job performance can vary because of location in the HPC system interconnect. Contiguous and compact allocations of compute nodes for parallel jobs is ideal but infeasible once other jobs have been placed. Reasonable performance of parallel jobs has been achieved with non-contiguous job placement in 3D-torus HPC systems using allocation strategies based on an ordered, one-dimensional sequence of nodes. Ordering of this list is an inexpensive way to incorporate topological information into the placement decision. With several orderings from which to choose - and others that could be created - what is the basis for choosing one ordering over others? Can the choice be made with out expensive, time-consuming benchmarks?   A method is described in this paper for the evaluation of node orderings for grid and torus interconnects based on a measure of job compactness at locations throughout the ordering. Several node orderings are evaluated for actual HPC systems across three sizes. Results suggest visually compelling guidance on the choice of node ordering. The choice is dependent not only on system size but may also be dependent on typical job sizes. Some orderings can be seen to be a consistently poor choice regardless of job size; most orderings are seen to be better only for a range of job sizes. Rarely an ordering is consistently better over the full range of job sizes - but only for a certain size and shape of system interconnect. Finally, the various node orderings re compared against a sequence of placements from a month of actual use on a large HPC system. Indications are that this evaluation method provides a cost-effective way to evaluate orderings and thereby provide generally improved job performance on HPC systems."}]