Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
AN EFFICIENT TASK ALLOCATION SCHEME FOR 2D MESH ARCHITECTURES
Autore:
YOO SM; YOUN HY; SHIRAZI B;
Indirizzi:
COLUMBUS STATE UNIV,DEPT COMP SCI COLUMBUS GA 31907 COLUMBUS STATE UNIV,DEPT COMP SCI & ENGN COLUMBUS GA 31907
Titolo Testata:
IEEE transactions on parallel and distributed systems
fascicolo: 9, volume: 8, anno: 1997,
pagine: 934 - 942
SICI:
1045-9219(1997)8:9<934:AETASF>2.0.ZU;2-V
Fonte:
ISI
Lingua:
ENG
Keywords:
COMPLETE SUBMESH RECOGNITION; COVERAGE SUBMESH; MESHES; TASK ALLOCATION; WAITING DELAY;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
CompuMath Citation Index
Science Citation Index Expanded
Science Citation Index Expanded
Citazioni:
18
Recensione:
Indirizzi per estratti:
Citazione:
S.M. Yoo et al., "AN EFFICIENT TASK ALLOCATION SCHEME FOR 2D MESH ARCHITECTURES", IEEE transactions on parallel and distributed systems, 8(9), 1997, pp. 934-942

Abstract

Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances, irrespective of the size of meshes and distribution of the shape of the incoming tasks.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 27/11/20 alle ore 22:19:40