{"id":"https://openalex.org/W7117141699","doi":"https://doi.org/10.1007/s42979-025-04577-y","title":"Integration of a Powerful Future Construct into the Taskflow System","display_name":"Integration of a Powerful Future Construct into the Taskflow System","publication_year":2025,"publication_date":"2025-12-24","ids":{"openalex":"https://openalex.org/W7117141699","doi":"https://doi.org/10.1007/s42979-025-04577-y"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-025-04577-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-025-04577-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-025-04577-y.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s42979-025-04577-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048801801","display_name":"R\u00fcdiger Nather","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"R\u00fcdiger Nather","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045882588","display_name":"Claudia Fohry","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Claudia Fohry","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048801801"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68726276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3617999851703644,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3617999851703644,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.30320000648498535,"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/T10126","display_name":"Logic, programming, and type systems","score":0.08940000087022781,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/construct","display_name":"Construct (python library)","score":0.6180999875068665},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.59170001745224},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5461000204086304},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5364000201225281},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.524399995803833},{"id":"https://openalex.org/keywords/futures-contract","display_name":"Futures contract","score":0.49869999289512634},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.4636000096797943},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.42969998717308044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7953000068664551},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6180999875068665},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.59170001745224},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5461000204086304},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5364000201225281},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C106306483","wikidata":"https://www.wikidata.org/wiki/Q183984","display_name":"Futures contract","level":2,"score":0.49869999289512634},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4636000096797943},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.42969998717308044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4260999858379364},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4025000035762787},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.33070001006126404},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C72634772","wikidata":"https://www.wikidata.org/wiki/Q386824","display_name":"Data integration","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27379998564720154},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s42979-025-04577-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-025-04577-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-025-04577-y.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s42979-025-04577-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-025-04577-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-025-04577-y.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7117141699.pdf","grobid_xml":"https://content.openalex.org/works/W7117141699.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1983587324","https://openalex.org/W1984848758","https://openalex.org/W2018419001","https://openalex.org/W2044872254","https://openalex.org/W2724352246","https://openalex.org/W2728037047","https://openalex.org/W2911748475","https://openalex.org/W3010949518","https://openalex.org/W3088721995","https://openalex.org/W3125427430","https://openalex.org/W3188917597","https://openalex.org/W4205190765","https://openalex.org/W4312491464","https://openalex.org/W4399145702","https://openalex.org/W4413269621"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Task-based":[1],"parallel":[2],"programming":[3,140,150],"is":[4,160],"a":[5,15,21,163,179],"common":[6],"approach":[7],"to":[8,116],"using":[9],"modern":[10],"multicore":[11],"architectures":[12],"efficiently.":[13],"Hereby":[14],"programmer":[16],"describes":[17,128,143],"the":[18,50,104,121,129,138,144,148,167],"computation":[19],"as":[20],"set":[22],"of":[23,106,123,132,147,170],"possibly":[24],"nested":[25,118,124],"tasks":[26],"and":[27,77,109,154],"their":[28],"dependencies.":[29],"The":[30,58,157],"dependencies":[31,45],"can":[32,38,46,84],"be":[33,40,47,68,85,92],"dynamic,":[34],"meaning":[35],"that":[36,66,83,102,165,175],"they":[37],"only":[39],"discovered":[41],"at":[42],"runtime.":[43],"Dynamic":[44],"expressed":[48],"with":[49,94,162,178],"future":[51],"construct,":[52],"which":[53],"comes":[54],"in":[55,70,137],"several":[56],"variants.":[57],"C++":[59,107],"standard,":[60],"for":[61,111,120],"instance,":[62],"defines":[63],"(shared)":[64],"futures":[65,90,108,119],"may":[67],"stored":[69],"data":[71],"structures,":[72],"accessed":[73],"by":[74],"multiple":[75],"tasks,":[76],"filled":[78],"through":[79],"an":[80],"associated":[81],"promise":[82],"transferred":[86],"between":[87],"tasks.":[88,125],"These":[89],"cannot":[91],"instantiated":[93],"incomplete":[95,112],"types,":[96],"however.":[97],"Recent":[98],"algorithmic":[99],"research":[100],"suggested":[101],"both":[103],"features":[105],"support":[110],"types":[113],"are":[114],"necessary":[115],"enable":[117],"synchronization":[122],"This":[126],"paper":[127],"first":[130],"implementation":[131],"such":[133],"futures,":[134],"called":[135],"flex-futures,":[136],"Taskflow":[139,149],"system.":[141,156],"It":[142],"corresponding":[145],"extensions":[146],"model,":[151],"user":[152],"interface,":[153],"runtime":[155],"extended":[158],"system":[159],"evaluated":[161],"benchmark":[164],"mimics":[166],"LU":[168],"decomposition":[169],"hierarchical":[171],"matrices.":[172],"We":[173],"found":[174],"flex-futures":[176],"come":[177],"higher":[180],"overhead":[181],"than":[182],"static":[183],"dependencies,":[184],"but":[185],"still":[186],"achieve":[187],"comparable":[188],"performance":[189],"while":[190],"offering":[191],"greater":[192],"flexibility.":[193]},"counts_by_year":[],"updated_date":"2026-03-12T06:13:28.667946","created_date":"2025-12-24T00:00:00"}