Title :
Scheduling the access of shared variables for the two communication nodes parallel structures
Author :
Fergany, Tahany A.
Author_Institution :
Comput. & Inf. Sci. Dept., New Haven Univ., West Haven, CT, USA
fDate :
30 Jun-2 Jul 1998
Abstract :
Scheduling algorithms should be provided to order parallel processes competing to access shared variables such that the execution time of their fork-join (parallel) structure is minimum. Previous research work focused on developing scheduling algorithms for single communication node parallel structures. In this paper we introduce a heuristic scheduling algorithm called maximum remaining time (MRT) for the two communication node parallel structures
Keywords :
parallel algorithms; processor scheduling; shared memory systems; execution time; fork-join structure; heuristic scheduling algorithm; maximum remaining time; parallel process ordering; shared variable access scheduling; two communication node parallel structures; Computational modeling; Concurrent computing; Costs; Heuristic algorithms; Processor scheduling; Protection; Reactive power;
Conference_Titel :
Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on
Conference_Location :
Athens
Print_ISBN :
0-8186-8538-7
DOI :
10.1109/ISCC.1998.702506
