An implementation of a concurrent gang scheduler for a PC-based cluster system

In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implemented FireCluster that consists of a P...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Systems and computers in Japan 2007-03, Vol.38 (3), p.39-48
Hauptverfasser: Hyoudou, Kazuki, Kozakai, Yasuyuki, Nakayama, Yasuichi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 48
container_issue 3
container_start_page 39
container_title Systems and computers in Japan
container_volume 38
creator Hyoudou, Kazuki
Kozakai, Yasuyuki
Nakayama, Yasuichi
description In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implemented FireCluster that consists of a PC‐based cluster system in which nodes are connected via the IEEE 1394 interface. Parallel job scheduling is important to use modern multiprocessor parallel computers efficiently. For example, gang scheduling is suitable for cluster systems that provide a user‐level communication library and many gang schedulers have been implemented for such systems. However, on low‐cost cluster systems with relatively low communication performance, the communications costs associated with a gang scheduling system whereby all nodes are synchronized each time the system switches jobs can be a significant problem. Therefore, we focus on concurrent gang scheduling and have implemented a concurrent gang scheduler for PC‐based cluster systems. The experimental results show that the system is able to perform synchronization with low communications costs, switch jobs with a low overhead, and is highly scalable to increases in the number of nodes. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(3): 39–48, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20458
doi_str_mv 10.1002/scj.20458
format Article
fullrecord <record><control><sourceid>istex_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_scj_20458</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ark_67375_WNG_TWKPGMKC_Z</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2228-7d9837185b7e87a6b283027c3f21a701a8281b3d4b979e1446a72fbf319cd46e3</originalsourceid><addsrcrecordid>eNp1kEtPAjEUhRujiYgu_Afduij0MdN2lmSiqCCSiMG4aTqdFgfnYVqI8u-tou7MXZzk3HNucj8AzgkeEIzpMJj1gOIklQegR1KKEZfJ0yHoYSkpIpzzY3ASwhpjEifrgdmohVXzVtvGthu9qboWdg5qaLrWbL2PJlzpdgWDebHltrYeus7H_TxHhQ62hKbehk20wy5KcwqOnK6DPfvRPni8ulzk12h6P77JR1NkKKUSiTKTTBCZFsJKoXlBJcNUGOYo0QITLakkBSuTIhOZJUnCtaCucIxkpky4ZX1wsb9rfBeCt069-arRfqcIVl8gVAShvkHE7HCffa9qu_s_qB7y298G2jeq-NPHX0P7V8UFE6lazsZqsZzMx3eTXD2zT6eibks</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An implementation of a concurrent gang scheduler for a PC-based cluster system</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Hyoudou, Kazuki ; Kozakai, Yasuyuki ; Nakayama, Yasuichi</creator><creatorcontrib>Hyoudou, Kazuki ; Kozakai, Yasuyuki ; Nakayama, Yasuichi</creatorcontrib><description>In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implemented FireCluster that consists of a PC‐based cluster system in which nodes are connected via the IEEE 1394 interface. Parallel job scheduling is important to use modern multiprocessor parallel computers efficiently. For example, gang scheduling is suitable for cluster systems that provide a user‐level communication library and many gang schedulers have been implemented for such systems. However, on low‐cost cluster systems with relatively low communication performance, the communications costs associated with a gang scheduling system whereby all nodes are synchronized each time the system switches jobs can be a significant problem. Therefore, we focus on concurrent gang scheduling and have implemented a concurrent gang scheduler for PC‐based cluster systems. The experimental results show that the system is able to perform synchronization with low communications costs, switch jobs with a low overhead, and is highly scalable to increases in the number of nodes. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(3): 39–48, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20458</description><identifier>ISSN: 0882-1666</identifier><identifier>EISSN: 1520-684X</identifier><identifier>DOI: 10.1002/scj.20458</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>cluster-based computing ; gang scheduler ; IEEE 1394 ; parallel processing systems</subject><ispartof>Systems and computers in Japan, 2007-03, Vol.38 (3), p.39-48</ispartof><rights>Copyright © 2007 Wiley Periodicals, Inc.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2228-7d9837185b7e87a6b283027c3f21a701a8281b3d4b979e1446a72fbf319cd46e3</citedby><cites>FETCH-LOGICAL-c2228-7d9837185b7e87a6b283027c3f21a701a8281b3d4b979e1446a72fbf319cd46e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fscj.20458$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fscj.20458$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Hyoudou, Kazuki</creatorcontrib><creatorcontrib>Kozakai, Yasuyuki</creatorcontrib><creatorcontrib>Nakayama, Yasuichi</creatorcontrib><title>An implementation of a concurrent gang scheduler for a PC-based cluster system</title><title>Systems and computers in Japan</title><addtitle>Syst. Comp. Jpn</addtitle><description>In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implemented FireCluster that consists of a PC‐based cluster system in which nodes are connected via the IEEE 1394 interface. Parallel job scheduling is important to use modern multiprocessor parallel computers efficiently. For example, gang scheduling is suitable for cluster systems that provide a user‐level communication library and many gang schedulers have been implemented for such systems. However, on low‐cost cluster systems with relatively low communication performance, the communications costs associated with a gang scheduling system whereby all nodes are synchronized each time the system switches jobs can be a significant problem. Therefore, we focus on concurrent gang scheduling and have implemented a concurrent gang scheduler for PC‐based cluster systems. The experimental results show that the system is able to perform synchronization with low communications costs, switch jobs with a low overhead, and is highly scalable to increases in the number of nodes. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(3): 39–48, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20458</description><subject>cluster-based computing</subject><subject>gang scheduler</subject><subject>IEEE 1394</subject><subject>parallel processing systems</subject><issn>0882-1666</issn><issn>1520-684X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNp1kEtPAjEUhRujiYgu_Afduij0MdN2lmSiqCCSiMG4aTqdFgfnYVqI8u-tou7MXZzk3HNucj8AzgkeEIzpMJj1gOIklQegR1KKEZfJ0yHoYSkpIpzzY3ASwhpjEifrgdmohVXzVtvGthu9qboWdg5qaLrWbL2PJlzpdgWDebHltrYeus7H_TxHhQ62hKbehk20wy5KcwqOnK6DPfvRPni8ulzk12h6P77JR1NkKKUSiTKTTBCZFsJKoXlBJcNUGOYo0QITLakkBSuTIhOZJUnCtaCucIxkpky4ZX1wsb9rfBeCt069-arRfqcIVl8gVAShvkHE7HCffa9qu_s_qB7y298G2jeq-NPHX0P7V8UFE6lazsZqsZzMx3eTXD2zT6eibks</recordid><startdate>200703</startdate><enddate>200703</enddate><creator>Hyoudou, Kazuki</creator><creator>Kozakai, Yasuyuki</creator><creator>Nakayama, Yasuichi</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>200703</creationdate><title>An implementation of a concurrent gang scheduler for a PC-based cluster system</title><author>Hyoudou, Kazuki ; Kozakai, Yasuyuki ; Nakayama, Yasuichi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2228-7d9837185b7e87a6b283027c3f21a701a8281b3d4b979e1446a72fbf319cd46e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>cluster-based computing</topic><topic>gang scheduler</topic><topic>IEEE 1394</topic><topic>parallel processing systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Hyoudou, Kazuki</creatorcontrib><creatorcontrib>Kozakai, Yasuyuki</creatorcontrib><creatorcontrib>Nakayama, Yasuichi</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>Systems and computers in Japan</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hyoudou, Kazuki</au><au>Kozakai, Yasuyuki</au><au>Nakayama, Yasuichi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An implementation of a concurrent gang scheduler for a PC-based cluster system</atitle><jtitle>Systems and computers in Japan</jtitle><addtitle>Syst. Comp. Jpn</addtitle><date>2007-03</date><risdate>2007</risdate><volume>38</volume><issue>3</issue><spage>39</spage><epage>48</epage><pages>39-48</pages><issn>0882-1666</issn><eissn>1520-684X</eissn><abstract>In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implemented FireCluster that consists of a PC‐based cluster system in which nodes are connected via the IEEE 1394 interface. Parallel job scheduling is important to use modern multiprocessor parallel computers efficiently. For example, gang scheduling is suitable for cluster systems that provide a user‐level communication library and many gang schedulers have been implemented for such systems. However, on low‐cost cluster systems with relatively low communication performance, the communications costs associated with a gang scheduling system whereby all nodes are synchronized each time the system switches jobs can be a significant problem. Therefore, we focus on concurrent gang scheduling and have implemented a concurrent gang scheduler for PC‐based cluster systems. The experimental results show that the system is able to perform synchronization with low communications costs, switch jobs with a low overhead, and is highly scalable to increases in the number of nodes. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(3): 39–48, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20458</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/scj.20458</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0882-1666
ispartof Systems and computers in Japan, 2007-03, Vol.38 (3), p.39-48
issn 0882-1666
1520-684X
language eng
recordid cdi_crossref_primary_10_1002_scj_20458
source Wiley Online Library Journals Frontfile Complete
subjects cluster-based computing
gang scheduler
IEEE 1394
parallel processing systems
title An implementation of a concurrent gang scheduler for a PC-based cluster system
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T03%3A33%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-istex_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20implementation%20of%20a%20concurrent%20gang%20scheduler%20for%20a%20PC-based%20cluster%20system&rft.jtitle=Systems%20and%20computers%20in%20Japan&rft.au=Hyoudou,%20Kazuki&rft.date=2007-03&rft.volume=38&rft.issue=3&rft.spage=39&rft.epage=48&rft.pages=39-48&rft.issn=0882-1666&rft.eissn=1520-684X&rft_id=info:doi/10.1002/scj.20458&rft_dat=%3Cistex_cross%3Eark_67375_WNG_TWKPGMKC_Z%3C/istex_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true