File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster

TitleFault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster
Authors
KeywordsCluster computing
Fault-tolerant scheduler
Heterogeneous systems
Neighborhood search
Parallel algorithms
Task graphs
Issue Date2001
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-8542
Citation
Journal Of Supercomputing, 2001, v. 19 n. 3, p. 299-314 How to Cite?
AbstractWe propose a new approach, called cluster-based search (CBS), for scheduling large task graphs in parallel on a heterogeneous cluster of workstations connected by a high-speed network (e.g., using an ATM switch at OC-3 speed). The CBS algorithm uses a parallel random neighborhood search which works by refining multiple different initial schedules simultaneously using different workstations. The workstations communicate periodically to exchange their best solutions found thus far in order to direct the search to more promising regions in the search space. Heterogeneity of machines is exploited by the biased partitioning of the search space. The parallel random neighborhood search is fault-tolerant in that the workload of a failed workstation is automatically redistributed to other workstations so that the search can continue. We have implemented the CBS algorithm as a core function of our on-going development of SSI middleware for a Sun workstation cluster.
Persistent Identifierhttp://hdl.handle.net/10722/73621
ISSN
2015 Impact Factor: 1.088
2015 SCImago Journal Rankings: 0.615
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2010-09-06T06:53:09Z-
dc.date.available2010-09-06T06:53:09Z-
dc.date.issued2001en_HK
dc.identifier.citationJournal Of Supercomputing, 2001, v. 19 n. 3, p. 299-314en_HK
dc.identifier.issn0920-8542en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73621-
dc.description.abstractWe propose a new approach, called cluster-based search (CBS), for scheduling large task graphs in parallel on a heterogeneous cluster of workstations connected by a high-speed network (e.g., using an ATM switch at OC-3 speed). The CBS algorithm uses a parallel random neighborhood search which works by refining multiple different initial schedules simultaneously using different workstations. The workstations communicate periodically to exchange their best solutions found thus far in order to direct the search to more promising regions in the search space. Heterogeneity of machines is exploited by the biased partitioning of the search space. The parallel random neighborhood search is fault-tolerant in that the workload of a failed workstation is automatically redistributed to other workstations so that the search can continue. We have implemented the CBS algorithm as a core function of our on-going development of SSI middleware for a Sun workstation cluster.en_HK
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-8542en_HK
dc.relation.ispartofJournal of Supercomputingen_HK
dc.subjectCluster computingen_HK
dc.subjectFault-tolerant scheduleren_HK
dc.subjectHeterogeneous systemsen_HK
dc.subjectNeighborhood searchen_HK
dc.subjectParallel algorithmsen_HK
dc.subjectTask graphsen_HK
dc.titleFault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation clusteren_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0920-8542&volume=19&issue=3&spage=299&epage=314&date=2001&atitle=Fault-Tolerant+Parallel+Scheduling+of+Tasks+on+a+Heterogeneous+High-Performance+Workstation+Clusteren_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1023/A:1011186732749en_HK
dc.identifier.scopuseid_2-s2.0-0035392842en_HK
dc.identifier.hkuros67360en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035392842&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume19en_HK
dc.identifier.issue3en_HK
dc.identifier.spage299en_HK
dc.identifier.epage314en_HK
dc.identifier.isiWOS:000169146300005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats