{"id":"https://openalex.org/W4414898279","doi":"https://doi.org/10.1109/cluster59342.2025.11186490","title":"EquilibrIO: Taming the I/O Tides in High-Performance Computing","display_name":"EquilibrIO: Taming the I/O Tides in High-Performance Computing","publication_year":2025,"publication_date":"2025-09-02","ids":{"openalex":"https://openalex.org/W4414898279","doi":"https://doi.org/10.1109/cluster59342.2025.11186490"},"language":"en","primary_location":{"id":"doi:10.1109/cluster59342.2025.11186490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster59342.2025.11186490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing (CLUSTER)","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/A5069260397","display_name":"Taylan \u00d6zden","orcid":"https://orcid.org/0000-0002-4540-4717"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Taylan \u00d6zden","raw_affiliation_strings":["Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024739565","display_name":"Ahmad Tarraf","orcid":"https://orcid.org/0000-0002-9174-5598"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ahmad Tarraf","raw_affiliation_strings":["Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018089961","display_name":"Felix Wolf","orcid":"https://orcid.org/0000-0001-6595-3599"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Felix Wolf","raw_affiliation_strings":["Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Darmstadt,Department of Computer Science,Darmstadt,Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28192774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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.7390999794006348,"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.7390999794006348,"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/scheduling","display_name":"Scheduling (production processes)","score":0.660099983215332},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5485000014305115},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5110999941825867},{"id":"https://openalex.org/keywords/slowdown","display_name":"Slowdown","score":0.44769999384880066},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4246000051498413},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.41999998688697815},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.36419999599456787},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.3481000065803528}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8011999726295471},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.660099983215332},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5756000280380249},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5485000014305115},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5110999941825867},{"id":"https://openalex.org/C2777242750","wikidata":"https://www.wikidata.org/wiki/Q31351","display_name":"Slowdown","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4246000051498413},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.41999998688697815},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.36419999599456787},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.3481000065803528},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3407000005245209},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3312999904155731},{"id":"https://openalex.org/C180198813","wikidata":"https://www.wikidata.org/wiki/Q121182","display_name":"Information system","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3107999861240387},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2946000099182129},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.28360000252723694},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2780940931","wikidata":"https://www.wikidata.org/wiki/Q174989","display_name":"File system","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2655999958515167},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cluster59342.2025.11186490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster59342.2025.11186490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing (CLUSTER)","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":29,"referenced_works":["https://openalex.org/W1572047826","https://openalex.org/W1596936080","https://openalex.org/W1937768181","https://openalex.org/W1988404188","https://openalex.org/W1989299066","https://openalex.org/W2010628428","https://openalex.org/W2039373661","https://openalex.org/W2096385147","https://openalex.org/W2150871235","https://openalex.org/W2182214061","https://openalex.org/W2412848782","https://openalex.org/W2597144055","https://openalex.org/W2750060497","https://openalex.org/W2963286618","https://openalex.org/W2965386444","https://openalex.org/W2985168981","https://openalex.org/W2995662961","https://openalex.org/W3004146676","https://openalex.org/W3040220297","https://openalex.org/W3180364792","https://openalex.org/W4243819070","https://openalex.org/W4285666793","https://openalex.org/W4285815064","https://openalex.org/W4292440311","https://openalex.org/W4313136793","https://openalex.org/W4320067933","https://openalex.org/W4383749470","https://openalex.org/W4385380507","https://openalex.org/W4404133421"],"related_works":[],"abstract_inverted_index":{"In":[0,95],"high-performance":[1,130],"computing":[2,131],"systems,":[3,81],"jobs":[4,30,36,168],"typically":[5],"have":[6],"exclusive":[7],"compute":[8],"access":[9],"but":[10],"share":[11],"storage":[12,80],"resources,":[13,40],"such":[14],"as":[15,35],"the":[16,54,69,89,138,147,167,182],"parallel":[17],"file":[18,178],"system,":[19],"often":[20],"becoming":[21],"a":[22,52,101],"point":[23],"of":[24,28,58,71,92,141,166,184],"contention.":[25],"Concurrent":[26],"execution":[27],"data-intensive":[29,72],"can":[31,145],"exacerbate":[32],"this":[33,96],"phenomenon,":[34],"compete":[37],"for":[38],"shared":[39,79],"impeding":[41],"each":[42],"other's":[43],"progress":[44],"while":[45,120],"suffering":[46],"from":[47,153],"limited":[48],"I/O":[49,56,90,117,148,172,185],"bandwidth.":[50],"As":[51],"result,":[53],"increasing":[55],"intensity":[57,91],"workloads":[59],"places":[60],"greater":[61],"demands":[62],"on":[63,84,137],"resource":[64,108],"management":[65],"systems":[66,86],"to":[67,156,176],"optimize":[68],"scheduling":[70,75,82,104],"jobs.":[73,94],"Although":[74],"decisions":[76],"significantly":[77],"impact":[78],"algorithms":[83],"production":[85],"generally":[87],"ignore":[88],"individual":[93],"work,":[97],"we":[98],"present":[99],"EquilibrIO,":[100],"novel":[102],"job":[103],"algorithm":[105,144],"that":[106,163],"minimizes":[107],"contention":[109,152],"and":[110,116],"maintains":[111],"fairness":[112],"by":[113,125,151,187],"balancing":[114],"computation":[115],"over":[118],"time,":[119],"requiring":[121],"minimal":[122],"information":[123,173],"collected":[124],"tools":[126],"commonly":[127],"used":[128],"in":[129],"systems.":[132],"We":[133],"show":[134],"that,":[135],"depending":[136],"desired":[139],"level":[140],"fairness,":[142],"our":[143],"reduce":[146],"slowdown":[149,186],"caused":[150],"64":[154],"%":[155,165],"4":[157],"%.":[158],"The":[159],"results":[160],"further":[161],"demonstrate":[162],"25":[164],"augmented":[169],"with":[170],"additional":[171],"are":[174],"sufficient":[175],"minimize":[177],"system":[179],"congestion,":[180],"cutting":[181],"effect":[183],"half.":[188]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}