loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)
Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations
Taipei, Taiwan
December 18-December 20
ISBN: 0-8186-8259-0
ASCII Text
x 
 
Wei Xie, Wei-Ming Lin, "Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 268, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1997.645107,
author = {Wei Xie and Wei-Ming Lin},
title = {Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1997},
issn = {1087-4089},
pages = {268},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645107},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations
SN - 1087-4089
SP
EP
A1 - Wei Xie,
A1 - Wei-Ming Lin,
PY - 1997
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Wei Xie, Univ. of Texas at San Antonio
Wei-Ming Lin, Univ. of Texas at San Antonio
In a bus-based network of workstations, a perfectly load balance arrangement does not always lead to the best performance due to potential communication resource conflicts. Such a situation arises when workstations tend to compete for the shared bus after they all finish their assigned workload at about the same time under such a load arrangement. In this paper, we provide a thorough analysis on how such communication conflicts can be minimized in a bus-based system by using a load-skewing assignment method. A probablistic model is used to analyze the needed skewing factor for a one-stage divide-and-conquer programming paradigm. Our analytical results are closely confirmed by various simulation and experiment outcome. The proposed technique can also be extended to handle multi-stage cases.
Citation:
Wei Xie, Wei-Ming Lin, "Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations," ispan, pp.268, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.