{"id":"https://openalex.org/W2024453736","doi":"https://doi.org/10.1145/1148109.1148124","title":"Minimizing the stretch when scheduling flows of biological requests","display_name":"Minimizing the stretch when scheduling flows of biological requests","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2024453736","doi":"https://doi.org/10.1145/1148109.1148124","mag":"2024453736"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00070293","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053847032","display_name":"Arnaud Legrand","orcid":null},"institutions":[{"id":"https://openalex.org/I4390039363","display_name":"Infection et inflammation","ror":"https://ror.org/021sh3243","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039363"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Arnaud Legrand","raw_affiliation_strings":["Laboratoire ID-IMAG, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire ID-IMAG, France","institution_ids":["https://openalex.org/I4390039363"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110081972","display_name":"Alan Su","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I4210148186","display_name":"Google (Canada)","ror":"https://ror.org/04d06q394","country_code":"CA","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969","https://openalex.org/I4210148186"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Alan Su","raw_affiliation_strings":["Google Inc., Cambridge, MA","Google Inc (Toronto - Canada)"],"affiliations":[{"raw_affiliation_string":"Google Inc., Cambridge, MA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc (Toronto - Canada)","institution_ids":["https://openalex.org/I4210148186"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086100728","display_name":"Fr\u00e9d\u00e9ric Vivien","orcid":"https://orcid.org/0000-0002-0663-6152"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Vivien","raw_affiliation_strings":["INRIA - LIP, ENS Lyon, France"],"affiliations":[{"raw_affiliation_string":"INRIA - LIP, ENS Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I1326498283","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053847032"],"corresponding_institution_ids":["https://openalex.org/I4390039363"],"apc_list":null,"apc_paid":null,"fwci":11.4639,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.98322329,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9329000115394592,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10171","display_name":"Biofuel production and bioconversion","score":0.9168000221252441,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.692561149597168},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5957603454589844},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.49612149596214294},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45500656962394714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31515175104141235},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17856863141059875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14323648810386658}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.692561149597168},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5957603454589844},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.49612149596214294},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45500656962394714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31515175104141235},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17856863141059875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14323648810386658},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/1148109.1148124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.321","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-48.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.300.2248","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.2248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/Spaa2006.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.2294","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.2294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/INRIA-5724.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.652","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/LIP-2005-48.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.6900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.6900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/INRIA-5724.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.1209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.1209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/Spaa2006.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.6750","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.6750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/~fvivien/Publications/LIP-2005-48.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00789441v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00789441","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Parallelism in Algorithms and Architectures SPAA\\'2006, 2006, Unknown, ⟨10.1145/1148109.1148124⟩","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:inria-00070293v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00070293","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-5724, INRIA. 2005, pp.22","raw_type":"Reports"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00070293v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00070293","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-5724, INRIA. 2005, pp.22","raw_type":"Reports"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1544352564","https://openalex.org/W1970286891","https://openalex.org/W1988328380","https://openalex.org/W2024453736","https://openalex.org/W2026489998","https://openalex.org/W2042312329","https://openalex.org/W2051216594","https://openalex.org/W2071404693","https://openalex.org/W2101083305","https://openalex.org/W2117876074","https://openalex.org/W2126520302","https://openalex.org/W2137287779","https://openalex.org/W2163488242","https://openalex.org/W2165014149","https://openalex.org/W2166867051","https://openalex.org/W4389615669","https://openalex.org/W7001388669"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2128410848","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2096289371","https://openalex.org/W2130555437","https://openalex.org/W3023290810"],"abstract_inverted_index":{"In":[0,155],"this":[1,35,44],"paper,":[2],"we":[3,63,120,157],"consider":[4],"the":[5,18,52,58,74,77,81,99,123,145,194],"problem":[6,15,84],"of":[7,102,125],"scheduling":[8],"distributed":[9],"biological":[10],"sequence":[11],"comparison":[12],"applications.":[13],"This":[14],"lies":[16],"in":[17,34,73,130,153,189,193],"divisible":[19,82],"load":[20],"framework":[21],"with":[22],"negligible":[23],"communication":[24],"costs.":[25],"Thus":[26],"far,":[27],"very":[28],"few":[29],"results":[30,89,109],"have":[31,70],"been":[32,71],"proposed":[33,72,139],"model.":[36],"We":[37,50,86],"discuss":[38],"and":[39,48,57,62,113,128],"select":[40],"relevant":[41],"metrics":[42],"for":[43,76,110,142,144,170,181],"framework:":[45],"namely":[46],"max-stretch":[47,143],"sumstretch.":[49],"explain":[51],"relationship":[53],"between":[54],"our":[55,159],"model":[56,79,147],"preemptive":[59],"uni-processor":[60,78,146],"case,":[61],"show":[64,158],"how":[65],"to":[66,80,149,166],"extend":[67],"algorithms":[68,127,161],"that":[69,136,178],"literature":[75],"multi-processor":[83],"domain.":[85],"recall":[87],"known":[88],"on":[90,98,163],"closely":[91],"related":[92],"problems,":[93],"derive":[94],"new":[95,107,116],"lower":[96],"bounds":[97],"competitive":[100],"ratio":[101],"any":[103],"on-line":[104,160],"algorithm,":[105],"present":[106],"competitiveness":[108],"existing":[111],"algorithms,":[112],"develop":[114],"several":[115],"online":[117],"heuristics.":[118],"Then,":[119],"extensively":[121],"study":[122,134,173],"performance":[124],"these":[126],"heuristics":[129,141,177],"realistic":[131],"scenarios.":[132],"Our":[133,172],"shows":[135],"all":[137],"previously":[138],"guaranteed":[140],"prove":[148],"be":[150,167],"particularly":[151],"inefficient":[152],"practice.":[154],"contrast,":[156],"based":[162],"linear":[164],"programming":[165],"nearoptimal":[168],"solutions":[169],"max-stretch.":[171],"also":[174],"clearly":[175],"suggests":[176],"are":[179],"efficient":[180],"both":[182],"metrics,":[183],"although":[184],"a":[185],"combined":[186],"optimization":[187],"is":[188],"theory":[190],"not":[191],"possible":[192],"general":[195],"case.":[196]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}