DocumentCode :
2053841
Title :
Gang scheduling with memory considerations
Author :
Batat, Anat ; Feitelson, Dror G.
Author_Institution :
Sch. of Comput. Sci. & Eng., Hebrew Univ., Jerusalem, Israel
fYear :
2000
fDate :
2000
Firstpage :
109
Lastpage :
114
Abstract :
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job´s processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing
Keywords :
paged storage; processor scheduling; admission controls; delayed execution; gang scheduling; memory considerations; memory pressure; paging activity; parallel machines; thrashing; time slicing; Computer science; Data structures; Delay; Electrical capacitance tomography; Operating systems; Processor scheduling; Quality of service; Read only memory; Resource management; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International
Conference_Location :
Cancun
Print_ISBN :
0-7695-0574-0
Type :
conf
DOI :
10.1109/IPDPS.2000.845971
Filename :
845971
Link To Document :
بازگشت