{"id":"https://openalex.org/W2126025681","doi":"https://doi.org/10.1109/clustr.2007.4629235","title":"Scheduling multiple divisible and indivisible tasks on bus networks","display_name":"Scheduling multiple divisible and indivisible tasks on bus networks","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2126025681","doi":"https://doi.org/10.1109/clustr.2007.4629235","mag":"2126025681"},"language":"en","primary_location":{"id":"doi:10.1109/clustr.2007.4629235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2007.4629235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Cluster Computing","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/A5040560297","display_name":"Jie Hu","orcid":"https://orcid.org/0000-0002-5157-0172"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jie Hu","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA","Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023924668","display_name":"Raymond Klefstad","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raymond Klefstad","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA","Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040560297"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16552541,"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":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9990000128746033,"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.8784010410308838},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6456975936889648},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5085815191268921},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4750523567199707},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.46515756845474243},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.41273796558380127},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38535207509994507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2789226770401001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06281468272209167}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8784010410308838},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6456975936889648},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5085815191268921},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4750523567199707},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.46515756845474243},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.41273796558380127},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38535207509994507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2789226770401001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06281468272209167},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clustr.2007.4629235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2007.4629235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W71992527","https://openalex.org/W1491464987","https://openalex.org/W1501013319","https://openalex.org/W1513123793","https://openalex.org/W1792340860","https://openalex.org/W1986244560","https://openalex.org/W1988630563","https://openalex.org/W2000192156","https://openalex.org/W2005382964","https://openalex.org/W2032005718","https://openalex.org/W2060614465","https://openalex.org/W2077602536","https://openalex.org/W2087297185","https://openalex.org/W2090887773","https://openalex.org/W2128757505","https://openalex.org/W2129095758","https://openalex.org/W2136931341","https://openalex.org/W2141491381","https://openalex.org/W2162219942","https://openalex.org/W2166669414","https://openalex.org/W2168694442","https://openalex.org/W2170938103","https://openalex.org/W2296319761","https://openalex.org/W2500988512","https://openalex.org/W3038504450","https://openalex.org/W3202710822","https://openalex.org/W4247393183","https://openalex.org/W4250589301","https://openalex.org/W4285719527","https://openalex.org/W6629353750","https://openalex.org/W6678980753","https://openalex.org/W6724172924","https://openalex.org/W6780529246","https://openalex.org/W6802072329"],"related_works":["https://openalex.org/W1809394610","https://openalex.org/W2128410848","https://openalex.org/W2014085448","https://openalex.org/W2071495327","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W3047653192","https://openalex.org/W2096289371","https://openalex.org/W2126232624","https://openalex.org/W2434525066"],"abstract_inverted_index":{"The":[0,84],"problem":[1],"of":[2,49,62,70,89],"scheduling":[3,42,90],"multiple":[4,63,91],"divisible":[5,30,43,92],"and":[6,31,93],"indivisible":[7,32,94],"tasks":[8,95],"on":[9],"a":[10,24],"distributed":[11],"bus":[12],"network":[13],"with":[14],"start-up":[15],"costs":[16],"is":[17,79],"considered.":[18],"In":[19],"this":[20],"paper,":[21],"we":[22],"propose":[23],"novel":[25],"algorithm":[26,58,78],"to":[27,105],"schedule":[28],"both":[29],"tasks.":[33,44],"We":[34,45,53,66,74],"utilize":[35],"one-round":[36],"installment":[37],"load":[38],"distribution":[39],"strategy":[40],"for":[41],"analyze":[46],"the":[47,68,97],"properties":[48],"our":[50,56,71,76],"proposed":[51,57,72,77],"algorithm.":[52,73],"demonstrate":[54],"how":[55],"works":[59],"by":[60],"means":[61],"illustrative":[64],"examples.":[65],"measure":[67],"performance":[69],"conclude":[75],"more":[80,98,107],"feasible":[81],"than":[82],"others.":[83],"analysis":[85],"provides":[86],"deeper":[87],"understanding":[88],"in":[96],"realistic":[99],"model,":[100],"which":[101],"will":[102],"allow":[103],"us":[104],"design":[106],"efficient":[108],"algorithms.":[109]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}