DIVISIBLE LOAD DISTRIBUTION IN A NETWORK OF PROCESSORS

被引：1

作者：

Bataineh, Sameer ^{[1
]}

机构：

[1] JUST, Dept Comp Engn, POB 3030, Irbid, Jordan

来源：

JOURNAL OF INTERCONNECTION NETWORKS | 2008年 / 9卷 / 1-2期

关键词：

Communication overhead; divisible jobs; multicomputer systems; scheduling; task assignment; network of workstations;

D O I：

10.1142/S021926590800214X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The paper presents a closed form solution for an optimum scheduling of a divisible job on an optimum number of processor arcanged in an optimum sequence in a multilevel tree networks. The solution has been derived for a single divisible job where there is no dependency among subtasks and the root processor can either perform communication and computation at the same time. The solution is carried out through three basic theorems. One of the theorems selects the optimum number of available processors that must participate in executing a divisible job. The other solves the sequencing problem in load distribution by which we are able to find the optimum sequence for load distribution in a generalized form. Having the optimum number of processors and their sequencing for load distribution, we have developed a closed form solution that determines the optimum share of each processor in the sequence such that the finish time is minimized. Any alteration of the number of processors, their sequences, or their shares that are determined by the three theorems will increase the finish time.

引用

页码：31 / 51

页数：21

共 50 条

[31] Energy Considerations for Divisible Load Processing
Drozdowski, Maciej
PARALLEL PROCESSING AND APPLIED MATHEMATICS, PART II, 2010, 6068 : 92 - 101
[32] Practical Load Reduction in Distribution Network
Svenda, Vanja
2016 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING (PESGM), 2016,
[33] Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications
Li, KQ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (12) : 1250 - 1261
[34] New Divisible Load Distribution Methods using Pipelined Communication Techniques on Tree and Pyramid Networks
Li, Keqin
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2011, 47 (02) : 806 - 819
[35] Network processors
Vin, H
Yavatkar, R
IEEE NETWORK, 2003, 17 (04): : 10 - 11
[36] The normal distribution is ⊞-infinitely divisible
Belinschi, Serban T.
Bozejko, Marek
Lehner, Franz
Speicher, Roland
ADVANCES IN MATHEMATICS, 2011, 226 (04) : 3677 - 3698
[37] Network processors
Engbersen, T
COMPUTER NETWORKS, 2003, 41 (05) : 545 - 547
[38] Multi-objective method for divisible load scheduling in multi-level tree network
Ghanbari, Shamsollah
Othman, Mohamed
Abu Bakar, Mohd Rizam
Leong, Wah June
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 54 : 132 - 143
[39] Divisible Load Scheduling in Systems with Limited Memory
M. Drozdowski
P. Wolniewicz
Cluster Computing, 2003, 6 (1) : 19 - 29
[40] Ten reasons to use divisible load theory
Robertazzi, TG
COMPUTER, 2003, 36 (05) : 63 - +

← 1 2 3 4 5 →