DocumentCode :
1988105
Title :
Optimizing the time cost of the parallel structures with a limited number of processors
Author :
Fergany, Tahany A. ; Ammar, Reda A. ; Neilforoshan-Dardashti, Mohamad R.
Author_Institution :
Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA
fYear :
1993
fDate :
27-29 May 1993
Firstpage :
272
Lastpage :
276
Abstract :
We develop an allocation algorithm that, in conjunction with optimal scheduling algorithms, yields the minimum time cost for a parallel structure. We assume a shared memory environment and a limited number of processors that is less than the degree of parallelism of the parallel structure
Keywords :
computational complexity; optimisation; parallel architectures; resource allocation; scheduling; shared memory systems; allocation algorithm; limited processor number; minimum time cost; optimal scheduling algorithms; parallel structures; parallelism degree; shared memory environment; time cost optimization; Computational modeling; Computer science; Concurrent computing; Cost function; Optimal scheduling; Parallel processing; Processor scheduling; Protection; Scheduling algorithm; Signal generators;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location :
Sudbury, Ont.
Print_ISBN :
0-8186-4212-2
Type :
conf
DOI :
10.1109/ICCI.1993.315365
Filename :
315365
Link To Document :
بازگشت