We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
Richard A. Dutton, Weizhen Mao, Jie Chen, William ...
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
We present a parallel iterative rigid body solver that avoids common artifacts at low iteration counts. In large or real-time simulations, iteration is often terminated before con...
Richard Tonge, Feodor Benevolenski, Andrey Voroshi...
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Di...
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...