Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Evolutionary Approaches with Multirecombination for the Parallel Machine Scheduling Problem
SCCC '00 Proceedings of the XX International Conference of the Chilean Computer Science Society
Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Toward a Realistic Task Scheduling Model
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Parallel computing becomes common tool to accelerate long-lasting electromagnetic computations. In some cases their realization does not bring an expecting gain. In this paper the authors present the results of the simulations from application created in order to show selected anomalies in parallel computing. The way of parallel system implementation is presented on the basic of direct graph model with the set of precedence constraints. The Graham's anomalies are discussed during optimization tasks scheduling issue, towards makespan criterion. The research was focused on three most frequently applied cases during acceleration the computations i.e. shortened tasks times execution, add additional computational power and reduction of selected precedence constraints. All phenomena are discussed and presented with the usage of Gantt's charts.