{"id":"https://openalex.org/W2625037576","doi":null,"title":"Periodicity is Optimal for Offline and Online Multi-Stage Adjoint Computations","display_name":"Periodicity is Optimal for Offline and Online Multi-Stage Adjoint Computations","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2625037576","mag":"2625037576"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-01244584v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01244584","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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-8822, INRIA Grenoble - Rh\u00f4ne-Alpes. 2015","raw_type":"info:eu-repo/semantics/report"},"parent_works":[],"lineage":["https://openalex.org/W2625037576"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01244584","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113566328","display_name":"Guillaume Aupy","orcid":"https://orcid.org/0000-0001-8862-3277","observed_orcids":["https://orcid.org/0000-0001-8862-3277"]},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]},{"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/I4210144566"]},{"id":"https://openalex.org/I4405261372","display_name":"ROMA: Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","ror":"https://ror.org/0571jty83","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4394709170","https://openalex.org/I4405261372"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Aupy, Guillaume","raw_affiliation_strings":["Laboratoire de l'Informatique du Parall\u00e9lisme","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":["https://openalex.org/I4405261372"]},{"raw_affiliation_string":"Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083095086","display_name":"Julien Herrmann","orcid":"https://orcid.org/0000-0003-4935-2368","observed_orcids":["https://orcid.org/0000-0003-4935-2368"]},"institutions":[{"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/I4210144566"]},{"id":"https://openalex.org/I4405261372","display_name":"ROMA: Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","ror":"https://ror.org/0571jty83","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4394709170","https://openalex.org/I4405261372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Herrmann, Julien","raw_affiliation_strings":["Laboratoire de l'Informatique du Parall\u00e9lisme","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":["https://openalex.org/I4405261372"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4943999946117401,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4943999946117401,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.15299999713897705,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.12070000171661377,"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/optimal-algorithms","display_name":"optimal algorithms","score":0.6909999847412109},{"id":"https://openalex.org/keywords/periodicity","display_name":"periodicity","score":0.7749999761581421},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.6079999804496765},{"id":"https://openalex.org/keywords/offline-algorithms","display_name":"offline algorithms","score":0.8989999890327454},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.7239999771118164},{"id":"https://openalex.org/keywords/constant-time-algorithms","display_name":"constant-time algorithms","score":0.5540000200271606},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithms","display_name":"asymptotically optimal algorithms","score":0.7839999794960022}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.698098361492157},{"id":"https://openalex.org/C2780102126","wikidata":"https://www.wikidata.org/wiki/Q10928179","display_name":"Online and offline","level":2,"score":0.5308752059936523},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.5165428519248962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43938788771629333},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.437561571598053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4021506607532501},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.38314488530158997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3349936306476593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2743173837661743},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.10848164558410645},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.04652175307273865},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:HAL:hal-01244584v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01244584","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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-8822, INRIA Grenoble - Rh\u00f4ne-Alpes. 2015","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01244584v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01244584","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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-8822, INRIA Grenoble - Rh\u00f4ne-Alpes. 2015","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2523771017","https://openalex.org/W2444318814","https://openalex.org/W4310063905","https://openalex.org/W28644973","https://openalex.org/W2006700733","https://openalex.org/W2887098676","https://openalex.org/W7147743154","https://openalex.org/W3149294321","https://openalex.org/W2889720240","https://openalex.org/W7096061418"],"abstract_inverted_index":{"We":[0,47,82],"reexamine":[1],"the":[2,34,55,58,70,73,88,93,97,101],"work":[3],"of":[4,17,96],"Aupy":[5],"et":[6],"al.":[7],"on":[8,33,69],"optimal":[9,35,52,74],"algorithms":[10],"for":[11,54,76,87,100],"multi-stageadjoint":[12],"computations,":[13],"where":[14],"two":[15],"levels":[16],"memories":[18],"are":[19],"available.":[20],"Previousoptimal":[21],"algorithm":[22,53],"had":[23],"a":[24,84],"quadratic":[25],"execution":[26],"time.":[27],"Here,":[28],"with":[29,44],"structuralarguments,":[30],"namely":[31],"periodicity,":[32],"solution,":[36],"we":[37,91],"provide":[38,49],"an":[39,50],"optimalalgorithm":[40],"in":[41],"constant":[42],"time,":[43],"appropriate":[45],"pre-processing.":[46],"also":[48],"asymptotically":[51],"online":[56,102],"problem,when":[57],"adjoint":[59,78],"graph":[60],"size":[61],"is":[62],"not":[63],"known":[64],"before-hand.":[65],"Again,":[66],"this":[67],"algorithmsrely":[68],"proof":[71],"that":[72],"solution":[75],"multi-stage":[77],"computationsis":[79],"weakly":[80],"periodic.":[81],"conjecture":[83],"closed-form":[85],"formula":[86],"period.":[89],"Finally,":[90],"experimentallyaccess":[92],"convergence":[94],"speed":[95],"approximation":[98],"ratio":[99],"problem,through":[103],"simulations.":[104]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2017-06-23T00:00:00"}