{"id":"https://openalex.org/W2159945790","doi":"https://doi.org/10.1109/ispdc.2003.1267667","title":"On the load distribution and performance of meta-computing systems","display_name":"On the load distribution and performance of meta-computing systems","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2159945790","doi":"https://doi.org/10.1109/ispdc.2003.1267667","mag":"2159945790"},"language":"en","primary_location":{"id":"doi:10.1109/ispdc.2003.1267667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067825806","display_name":"Ilias \u039a. Savvas","orcid":"https://orcid.org/0000-0003-2060-0911"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"I.K. Savvas","raw_affiliation_strings":["Parallel Computational Research Group, Department of Computer Science, University College Dublin, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Computational Research Group, Department of Computer Science, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039829612","display_name":"Tahar Kechadi","orcid":"https://orcid.org/0000-0002-0176-6281"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"T. Kechadi","raw_affiliation_strings":["Parallel Computational Research Group, Department of Computer Science, University College Dublin, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Computational Research Group, Department of Computer Science, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7486,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79322288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"222","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8510363101959229},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6812419295310974},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5946063995361328},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5932965874671936},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5911303162574768},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5327843427658081},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5206693410873413},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.49750545620918274},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4782535135746002},{"id":"https://openalex.org/keywords/grid-system","display_name":"Grid system","score":0.4596289396286011},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.456666499376297},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.44922131299972534},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4424118399620056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28672322630882263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25390002131462097},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.082795649766922},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0768381655216217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06734883785247803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8510363101959229},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6812419295310974},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5946063995361328},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5932965874671936},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5911303162574768},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5327843427658081},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5206693410873413},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.49750545620918274},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4782535135746002},{"id":"https://openalex.org/C2989099649","wikidata":"https://www.wikidata.org/wiki/Q233558","display_name":"Grid system","level":3,"score":0.4596289396286011},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.456666499376297},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.44922131299972534},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4424118399620056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28672322630882263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25390002131462097},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.082795649766922},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0768381655216217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06734883785247803},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispdc.2003.1267667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W104971177","https://openalex.org/W601666729","https://openalex.org/W1487374707","https://openalex.org/W1511549656","https://openalex.org/W1527527905","https://openalex.org/W1559215823","https://openalex.org/W1708212678","https://openalex.org/W1824313915","https://openalex.org/W1830633432","https://openalex.org/W1856288208","https://openalex.org/W2011039300","https://openalex.org/W2022306346","https://openalex.org/W2025896589","https://openalex.org/W2041754927","https://openalex.org/W2057392949","https://openalex.org/W2086814463","https://openalex.org/W2091257550","https://openalex.org/W2131906734","https://openalex.org/W2146766934","https://openalex.org/W2152408640","https://openalex.org/W2476899828","https://openalex.org/W2500308345","https://openalex.org/W6604292639","https://openalex.org/W6630440188","https://openalex.org/W6638853389","https://openalex.org/W6656743830"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2167574351","https://openalex.org/W3184267879","https://openalex.org/W2373973180","https://openalex.org/W3134500102","https://openalex.org/W1995743638","https://openalex.org/W2183278190"],"abstract_inverted_index":{"In":[0,36],"this":[1,37],"paper,":[2],"we":[3,21,99],"study":[4,22],"a":[5,15,27,43,104,125],"high-performance":[6],"Heterogeneous":[7],"Distributed":[8],"System":[9],"(HDS)":[10],"that":[11,54,102],"is":[12,48,91],"employed":[13],"as":[14,50],"computing":[16],"platform":[17],"or":[18],"grid.":[19],"Precisely,":[20],"the":[23,39,46,51,86,116],"problem":[24,88],"of":[25,30,62,67],"scheduling":[26,63,128],"large":[28,96],"number":[29],"CPU-intensive":[31],"tasks":[32,65],"on":[33],"such":[34,95],"systems.":[35],"study,":[38],"time":[40,118],"spent":[41],"by":[42,112],"task":[44],"in":[45,94,130],"system":[47,107],"considered":[49],"main":[52],"issue":[53],"needs":[55],"to":[56,124,132],"be":[57],"minimized.":[58],"The":[59],"proposed":[60],"techniques":[61],"dynamic":[64],"consist":[66],"two":[68],"heuristic":[69],"algorithms;":[70],"Recursive":[71],"Neighbor":[72],"Search":[73],"(RNS)":[74],"and":[75,135],"Augmented":[76],"Tabu-Search":[77],"(ATS)":[78],"algorithm.":[79],"Our":[80],"technique":[81],"does":[82],"not":[83],"address":[84],"directly":[85],"load-balancing":[87],"since":[89],"it":[90],"completely":[92],"unrealistic":[93],"environments,":[97],"but":[98],"will":[100],"show":[101],"even":[103],"nonperfectly":[105],"load-balanced":[106],"can":[108],"behave":[109],"reasonably":[110],"well":[111,126],"taking":[113],"into":[114],"account":[115],"tasks'":[117],"demands.":[119],"These":[120],"algorithms":[121],"are":[122],"compared":[123],"known":[127],"algorithm,":[129],"order":[131],"compare,":[133],"evaluate,":[134],"clarify":[136],"their":[137],"performance.":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
