loading...
On a Class of Concatenated (2 log2N-1)-Stage Interconnection Networks
Beijing, CHINA June 12-June 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1996.5090371996 International Symposium on Paral ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Y. Kim, S.-W. Seo, T. Feng, "On a Class of Concatenated (2 log2N-1)-Stage Interconnection Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 537, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1996.509037,
author = {Y. Kim and S.-W. Seo and T. Feng},
title = {On a Class of Concatenated (2 log2N-1)-Stage Interconnection Networks},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1996},
issn = {1087-4089},
pages = {537},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1996.509037},
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 - On a Class of Concatenated (2 log2N-1)-Stage Interconnection Networks
SN - 1087-4089
SP
EP
A1 - Y. Kim,
A1 - S.-W. Seo,
A1 - T. Feng,
PY - 1996
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization, of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP a1gorith.m. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms. static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP a1gorith.m. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms.
Citation:
Y. Kim, S.-W. Seo, T. Feng, "On a Class of Concatenated (2 log2N-1)-Stage Interconnection Networks," ispan, pp.537, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.