File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1023/A:1011186732749
- Scopus: eid_2-s2.0-0035392842
- WOS: WOS:000169146300005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster
Title | Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster |
---|---|
Authors | |
Keywords | Cluster computing Fault-tolerant scheduler Heterogeneous systems Neighborhood search Parallel algorithms Task graphs |
Issue Date | 2001 |
Publisher | Springer 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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/73621 |
ISSN | 2023 Impact Factor: 2.5 2023 SCImago Journal Rankings: 0.763 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwok, YK | en_HK |
dc.date.accessioned | 2010-09-06T06:53:09Z | - |
dc.date.available | 2010-09-06T06:53:09Z | - |
dc.date.issued | 2001 | en_HK |
dc.identifier.citation | Journal Of Supercomputing, 2001, v. 19 n. 3, p. 299-314 | en_HK |
dc.identifier.issn | 0920-8542 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/73621 | - |
dc.description.abstract | We 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.language | eng | en_HK |
dc.publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-8542 | en_HK |
dc.relation.ispartof | Journal of Supercomputing | en_HK |
dc.subject | Cluster computing | en_HK |
dc.subject | Fault-tolerant scheduler | en_HK |
dc.subject | Heterogeneous systems | en_HK |
dc.subject | Neighborhood search | en_HK |
dc.subject | Parallel algorithms | en_HK |
dc.subject | Task graphs | en_HK |
dc.title | Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+Cluster | en_HK |
dc.identifier.email | Kwok, YK:ykwok@eee.hku.hk | en_HK |
dc.identifier.authority | Kwok, YK=rp00128 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1023/A:1011186732749 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0035392842 | en_HK |
dc.identifier.hkuros | 67360 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0035392842&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 19 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 299 | en_HK |
dc.identifier.epage | 314 | en_HK |
dc.identifier.isi | WOS:000169146300005 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Kwok, YK=7101857718 | en_HK |
dc.identifier.issnl | 0920-8542 | - |