DocumentCode :
3039744
Title :
Job Management in WebCom
Author :
Cafferkey, Neil ; Healy, Philip D. ; Power, David A. ; Morrison, John P.
Author_Institution :
Univ. Coll. Cork, Cork
fYear :
2007
fDate :
5-8 July 2007
Firstpage :
6
Lastpage :
6
Abstract :
WebCom is a metacomputer based on the Condensed Graphs model of computing. Within this model, applications are represented as directed acyclic graphs with the nodes representing tasks and arcs their sequencing constraints. This paper presents the job management system used in WebCom. We describe the techniques required to apply common job management concepts, such as suspension, migration and monitoring, to the execution of applications expressed as Condensed Graphs.
Keywords :
Internet; graph theory; metacomputing; WebCom; condensed graphs model; directed acyclic graphs; job management; metacomputer; nodes representing tasks; Computer architecture; Distributed computing; Engines; Fault tolerance; Libraries; Monitoring; Peer to peer computing; Power system modeling; Processor scheduling; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Computing, 2007. ISPDC '07. Sixth International Symposium on
Conference_Location :
Hagenberg
Print_ISBN :
0-7695-2917
Type :
conf
DOI :
10.1109/ISPDC.2007.34
Filename :
4271896
Link To Document :
بازگشت