Learn More
Parallel job scheduling has gained increasing recognition in recent years as a distinct area of study. However , there is concern about the divergence of theory and practice in the eld. We review theoretical research in this area, and recommendations based on recent results. This is contrasted with a proposal for standard interfaces among the components of(More)
Thanks to MPI, writing portable message passing parallel programs is almost a reality. One of the remaining problems is le I/O. Although parallel le systems support similar interfaces, the lack of a standard makes developing a truly portable program impossible. It is not feasible to develop large scientiic applications from scratch for each generation of(More)
or [rle ,3Lno mawall in[er[_auor_ap k, onrerence on bystem bclences-i_"o_ Abstract We designed a new network architecture, the P-Mesh, which combhres the scalabili_, and fault resilience of a torus with the performance of a switch. We compare tire scalability, performance, and cost of the hub, switch, torus, tree, and P-Mesh architectures. Tire latter three(More)
We investigate the feasibility of running parallel applications on heterogeneous clusters. The motivation for doing so is twofold. First, it is practical to be able to pull together existing machines to run a job that is too big for any one of them, especially if such jobs are run rarely. Second, in the event of an emergency, where a very large problem must(More)
  • 1