{"id":"https://openalex.org/W2101681305","doi":"https://doi.org/10.1109/hpdc.2006.1652155","title":"Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O","display_name":"Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O","publication_year":2006,"publication_date":"2006-07-21","ids":{"openalex":"https://openalex.org/W2101681305","doi":"https://doi.org/10.1109/hpdc.2006.1652155","mag":"2101681305"},"language":"en","primary_location":{"id":"doi:10.1109/hpdc.2006.1652155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2006.1652155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 15th IEEE International Conference on High Performance Distributed 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/A5009864169","display_name":"Gaurav Khanna","orcid":"https://orcid.org/0000-0002-6846-3437"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Khanna","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109194093","display_name":"Naga Vydyanathan","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Vydyanathan","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026046737","display_name":"\u00dcmit V. \u00c7ataly\u00fcrek","orcid":"https://orcid.org/0000-0002-5625-3758"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"U. Catalyurek","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037383891","display_name":"Tahsin Kur\u00e7","orcid":"https://orcid.org/0000-0001-9237-4306"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Kurc","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006650430","display_name":"Sriram Krishnamoorthy","orcid":"https://orcid.org/0000-0002-4682-1002"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Krishnamoorthy","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027517817","display_name":"P. Sadayappan","orcid":"https://orcid.org/0000-0002-4737-2034"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Sadayappan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072946826","display_name":"Joel Saltz","orcid":"https://orcid.org/0000-0002-3451-2165"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Saltz","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State Uinversity, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5009864169"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":1.5769,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85265863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1511","issue":null,"first_page":"241","last_page":"252"},"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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8391530513763428},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6412962675094604},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6007166504859924},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5663084983825684},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5135121941566467},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4781966209411621},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4544355273246765},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.43911847472190857},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.413621723651886},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3906075060367584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.186915785074234},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18574213981628418},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1416850984096527},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08271375298500061},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07974246144294739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8391530513763428},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6412962675094604},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6007166504859924},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5663084983825684},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5135121941566467},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4781966209411621},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4544355273246765},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.43911847472190857},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.413621723651886},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3906075060367584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.186915785074234},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18574213981628418},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1416850984096527},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08271375298500061},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07974246144294739}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpdc.2006.1652155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2006.1652155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 15th IEEE International Conference on High Performance Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.6315","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~khannag/hpdc06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1661898001","https://openalex.org/W1865181309","https://openalex.org/W1903036498","https://openalex.org/W1990033420","https://openalex.org/W1994669411","https://openalex.org/W2078174680","https://openalex.org/W2099562728","https://openalex.org/W2103166562","https://openalex.org/W2118436132","https://openalex.org/W2140926207","https://openalex.org/W2142184646","https://openalex.org/W2146438496","https://openalex.org/W2153319255","https://openalex.org/W3140544810","https://openalex.org/W4244921807","https://openalex.org/W6674985325"],"related_works":["https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W4386128920","https://openalex.org/W2225350526","https://openalex.org/W1935185185","https://openalex.org/W4300092030","https://openalex.org/W2978148977","https://openalex.org/W2377713709"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,67,71,91,122],"problem":[4],"of":[5,8,11],"efficient":[6],"execution":[7,74],"a":[9,30,46,95],"batch":[10,73],"data-intensive":[12],"tasks":[13],"with":[14,121],"batch-shared":[15],"I/O":[16],"behavior,":[17],"on":[18],"coupled":[19],"storage":[20],"and":[21,41,44,58,89,101,110],"compute":[22],"clusters.":[23],"Two":[24],"scheduling":[25,40,57,79,108],"schemes":[26],"are":[27],"proposed:":[28],"1)":[29,66],"0-1":[31],"integer":[32],"programming":[33],"(IP)":[34],"based":[35,50,124],"approach,":[36],"which":[37,54],"couples":[38],"task":[39,56],"data":[42,59],"replication,":[43],"2)":[45,90],"bi-level":[47],"hypergraph":[48],"partitioning":[49],"heuristic":[51],"approach":[52,125],"(BiPartition),":[53],"decouples":[55],"replication.":[60],"The":[61],"experimental":[62],"results":[63],"show":[64],"that:":[65],"IP":[68,123],"scheme":[69,93],"achieves":[70],"best":[72],"time,":[75],"but":[76],"has":[77,105],"significant":[78],"overhead,":[80],"thereby":[81],"restricting":[82],"its":[83],"application":[84],"to":[85],"small":[86],"scale":[87],"workloads,":[88],"BiPartition":[92],"is":[94],"better":[96],"fit":[97],"for":[98],"larger":[99],"workloads":[100],"systems":[102],"-":[103],"it":[104],"very":[106],"low":[107],"overhead":[109],"no":[111],"more":[112],"than":[113],"5-10%":[114],"degradation":[115],"in":[116],"solution":[117],"quality,":[118],"when":[119],"compared":[120]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}