{"id":"https://openalex.org/W2118436132","doi":"https://doi.org/10.1109/hpdc.2002.1029935","title":"Decoupling computation and data scheduling in distributed data-intensive applications","display_name":"Decoupling computation and data scheduling in distributed data-intensive applications","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2118436132","doi":"https://doi.org/10.1109/hpdc.2002.1029935","mag":"2118436132"},"language":"en","primary_location":{"id":"doi:10.1109/hpdc.2002.1029935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2002.1029935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049985064","display_name":"Kavitha Ranganathan","orcid":"https://orcid.org/0000-0002-6877-9079"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Ranganathan","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL, USA","Dept. of Comput. Sci., Chicago Univ, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Chicago Univ, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032231503","display_name":"Ian Foster","orcid":"https://orcid.org/0000-0003-2129-5269"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]},{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Foster","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL, USA","Math and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA","Dept. of Comput. Sci., Chicago Univ, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Math and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA","institution_ids":["https://openalex.org/I1282105669"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Chicago Univ, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.7659,"has_fulltext":false,"cited_by_count":464,"citation_normalized_percentile":{"value":0.99585273,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"352","last_page":"358"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9972000122070312,"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.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8300015330314636},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7693555355072021},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6870614290237427},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6074599027633667},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5221786499023438},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4492623805999756},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4308857321739197},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4214492738246918},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13319846987724304},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09018772840499878},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0875367522239685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8300015330314636},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7693555355072021},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6870614290237427},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6074599027633667},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5221786499023438},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4492623805999756},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4308857321739197},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4214492738246918},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13319846987724304},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09018772840499878},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0875367522239685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/hpdc.2002.1029935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpdc.2002.1029935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.4633","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~krangana/papers/decoupling_comp_data.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.934","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.globus.org/research/papers/decouple.pdf","raw_type":"text"}],"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":30,"referenced_works":["https://openalex.org/W1550091196","https://openalex.org/W1559700831","https://openalex.org/W1578191733","https://openalex.org/W1581690648","https://openalex.org/W1731525877","https://openalex.org/W1822495682","https://openalex.org/W1863706572","https://openalex.org/W1903036498","https://openalex.org/W1996406271","https://openalex.org/W2032930624","https://openalex.org/W2071075503","https://openalex.org/W2083353055","https://openalex.org/W2091257550","https://openalex.org/W2094186309","https://openalex.org/W2111996486","https://openalex.org/W2122642787","https://openalex.org/W2126831426","https://openalex.org/W2127768834","https://openalex.org/W2142590813","https://openalex.org/W2145055368","https://openalex.org/W2152408640","https://openalex.org/W2154010459","https://openalex.org/W2157740020","https://openalex.org/W2163185337","https://openalex.org/W4255701709","https://openalex.org/W6632982049","https://openalex.org/W6634780803","https://openalex.org/W6638153754","https://openalex.org/W6678935712","https://openalex.org/W7055291010"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W2225350526","https://openalex.org/W3036719625","https://openalex.org/W2151049026","https://openalex.org/W2014733634"],"abstract_inverted_index":{"In":[0],"high-energy":[1],"physics,":[2],"bioinformatics,":[3],"and":[4,18,55,66,73,116,124,155,171],"other":[5],"disciplines,":[6],"we":[7],"encounter":[8],"applications":[9],"involving":[10],"numerous,":[11],"loosely":[12],"coupled":[13],"jobs":[14,65],"that":[15,81,135],"both":[16],"access":[17,114],"generate":[19],"large":[20,68],"data":[21,88,113,153],"sets.":[22],"So-called":[23],"Data":[24],"Grids":[25],"seek":[26],"to":[27,46,49,96,128,140,151],"harness":[28],"geographically":[29],"distributed":[30],"resources":[31],"for":[32],"such":[33,41],"large-scale":[34],"data-intensive":[35],"problems.":[36,84],"Yet":[37],"effective":[38],"scheduling":[39,79,98],"in":[40],"environments":[42],"is":[43,138,147],"challenging,":[44],"due":[45],"a":[47,51,67,78,104,120],"need":[48],"address":[50],"variety":[52],"of":[53,64,70,111,122,144],"metrics":[54],"constraints":[56],"while":[57,136],"dealing":[58],"with":[59],"multiple,":[60],"potentially":[61],"independent":[62],"sources":[63],"number":[69],"storage,":[71],"compute,":[72],"network":[74],"resources.":[75],"We":[76,118],"describe":[77],"framework":[80],"addresses":[82],"these":[83,159],"Within":[85],"this":[86],"framework,":[87],"movement":[89,154],"operations":[90],"may":[91],"be":[92,163],"either":[93],"tightly":[94],"bound":[95],"job":[97],"decisions":[99],"or,":[100],"alternatively,":[101],"performed":[102],"by":[103],"decoupled,":[105],"asynchronous":[106],"process":[107],"on":[108],"the":[109,142,169],"basis":[110],"observed":[112],"patterns":[115],"load.":[117],"develop":[119],"family":[121],"algorithms":[123],"use":[125],"simulation":[126],"studies":[127],"evaluate":[129],"various":[130],"combinations.":[131],"Our":[132],"results":[133],"suggest":[134],"it":[137,146],"necessary":[139,150],"consider":[141],"impact":[143],"replication,":[145],"not":[148],"always":[149],"couple":[152],"computation":[156],"scheduling.":[157],"Instead,":[158],"two":[160],"activities":[161],"can":[162],"addressed":[164],"separately,":[165],"thus":[166],"significantly":[167],"simplifying":[168],"design":[170],"implementation.":[172]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":22},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":27}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}