{"id":"https://openalex.org/W2798901509","doi":"https://doi.org/10.1017/s1471068418000170","title":"Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP","display_name":"Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP","publication_year":2018,"publication_date":"2018-05-31","ids":{"openalex":"https://openalex.org/W2798901509","doi":"https://doi.org/10.1017/s1471068418000170","mag":"2798901509"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068418000170","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000170","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/635A31AADB51E41D84AB71B1859A1D27/S1471068418000170a.pdf/div-class-title-optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/635A31AADB51E41D84AB71B1859A1D27/S1471068418000170a.pdf/div-class-title-optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076382835","display_name":"Marc Dahlem","orcid":"https://orcid.org/0000-0003-3877-8179"},"institutions":[{"id":"https://openalex.org/I4210109972","display_name":"Insiders Technologies (Germany)","ror":"https://ror.org/0179g4w23","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210109972"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MARC DAHLEM","raw_affiliation_strings":["Insiders Technologies GmbH, Kaiserslautern, Germanyhttps://insiders-technologies.de"],"affiliations":[{"raw_affiliation_string":"Insiders Technologies GmbH, Kaiserslautern, Germanyhttps://insiders-technologies.de","institution_ids":["https://openalex.org/I4210109972"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062452614","display_name":"Anoop Bhagyanath","orcid":"https://orcid.org/0000-0001-7866-5983"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ANOOP BHAGYANATH","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germanyhttps://es.cs.uni-kl.de"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germanyhttps://es.cs.uni-kl.de","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081184867","display_name":"Klaus Schneider","orcid":"https://orcid.org/0000-0002-1305-7132"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"KLAUS SCHNEIDER","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germanyhttps://es.cs.uni-kl.de"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germanyhttps://es.cs.uni-kl.de","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076382835"],"corresponding_institution_ids":["https://openalex.org/I4210109972"],"apc_list":null,"apc_paid":null,"fwci":0.1692,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5808207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"3-4","first_page":"438","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"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/datapath","display_name":"Datapath","score":0.8713560104370117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8461236953735352},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.7208993434906006},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7019361853599548},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5697028040885925},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5530915856361389},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.5438128709793091},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4693254828453064},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.436073899269104},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43354883790016174},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.4158828854560852},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25568798184394836},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.2238774299621582},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12420201301574707}],"concepts":[{"id":"https://openalex.org/C2781198647","wikidata":"https://www.wikidata.org/wiki/Q1633673","display_name":"Datapath","level":2,"score":0.8713560104370117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8461236953735352},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.7208993434906006},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7019361853599548},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5697028040885925},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5530915856361389},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.5438128709793091},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4693254828453064},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.436073899269104},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43354883790016174},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.4158828854560852},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25568798184394836},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.2238774299621582},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12420201301574707},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s1471068418000170","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000170","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/635A31AADB51E41D84AB71B1859A1D27/S1471068418000170a.pdf/div-class-title-optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"doi:10.29007/678g","is_oa":true,"landing_page_url":"https://doi.org/10.29007/678g","pdf_url":"https://easychair.org/publications/preprint_open/m8hr","source":{"id":"https://openalex.org/S4210223723","display_name":"EasyChair preprint","issn_l":"2516-2314","issn":["2516-2314"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EasyChair Preprints","raw_type":"report-series"},{"id":"pmh:oai:arXiv.org:1804.10998","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.10998","pdf_url":"https://arxiv.org/pdf/1804.10998","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2798901509","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1804.10998.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1804.10998","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.10998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s1471068418000170","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000170","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/635A31AADB51E41D84AB71B1859A1D27/S1471068418000170a.pdf/div-class-title-optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2798901509.pdf","grobid_xml":"https://content.openalex.org/works/W2798901509.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W205596015","https://openalex.org/W999267547","https://openalex.org/W1513230022","https://openalex.org/W1549711261","https://openalex.org/W1561616310","https://openalex.org/W1579041286","https://openalex.org/W1645097628","https://openalex.org/W1674952968","https://openalex.org/W1885448744","https://openalex.org/W1911031955","https://openalex.org/W2024598204","https://openalex.org/W2099220296","https://openalex.org/W2113294203","https://openalex.org/W2116556636","https://openalex.org/W2120505393","https://openalex.org/W2154332652","https://openalex.org/W2171732229","https://openalex.org/W2294034716","https://openalex.org/W2399145680","https://openalex.org/W2565417786","https://openalex.org/W2728577422","https://openalex.org/W2768980428"],"related_works":["https://openalex.org/W2892326913","https://openalex.org/W2565417786","https://openalex.org/W3032097305","https://openalex.org/W3165113540","https://openalex.org/W2798994962","https://openalex.org/W2768980428","https://openalex.org/W2294034716","https://openalex.org/W1946666264","https://openalex.org/W2120988653","https://openalex.org/W2122777354","https://openalex.org/W2135300625","https://openalex.org/W174513348","https://openalex.org/W2138098630","https://openalex.org/W1581686471","https://openalex.org/W2137995472","https://openalex.org/W569329666","https://openalex.org/W15900856","https://openalex.org/W2282834603","https://openalex.org/W2116556636","https://openalex.org/W2121746715"],"abstract_inverted_index":{"Abstract":[0],"Conventional":[1],"processor":[2,24],"architectures":[3,25],"are":[4,74,167],"restricted":[5],"in":[6,133,140,214],"exploiting":[7],"instruction":[8],"level":[9],"parallelism":[10],"(ILP)":[11],"due":[12],"to":[13,38,89,112,169,181],"the":[14,31,52,58,92,186,194],"relatively":[15],"low":[16],"number":[17],"of":[18,48,51,102,163,189],"programmer-visible":[19],"registers.":[20],"Therefore,":[21],"more":[22],"recent":[23],"expose":[26],"their":[27,82,183],"datapaths":[28],"so":[29],"that":[30,193],"compiler":[32],"(1)":[33],"can":[34,44,198],"schedule":[35],"parallel":[36],"instructions":[37],"different":[39],"processing":[40,53,72],"units":[41,73],"and":[42,84,107,117,152,203],"(2)":[43],"make":[45],"effective":[46],"use":[47],"local":[49],"storage":[50],"units.":[54],"Among":[55],"these":[56],"architectures,":[57],"Synchronous":[59],"Control":[60],"Asynchronous":[61],"Dataflow":[62],"(SCAD)":[63],"architecture":[64,70],"is":[65,98,209],"a":[66,100,160,175],"new":[67],"exposed":[68],"datapath":[69],"whose":[71],"equipped":[75],"with":[76,200],"first-in":[77],"first-out":[78],"(FIFO)":[79],"buffers":[80],"at":[81],"input":[83],"output":[85],"ports.":[86],"In":[87,104],"contrast":[88],"register-based":[90],"machines,":[91],"optimal":[93,114,118,155,172],"code":[94,157],"generation":[95],"for":[96,122,149,174,212],"SCAD":[97,156],"still":[99],"matter":[101],"research.":[103],"particular,":[105],"SAT":[106,201],"SMT":[108,205],"solvers":[109,202],"were":[110],"used":[111],"generate":[113,170],"resource":[115,151],"constrained":[116,120,154],"time":[119,153],"schedules":[121,173],"SCAD,":[123],"respectively.":[124],"As":[125,159],"Answer":[126],"Set":[127],"Programming":[128],"(ASP)":[129],"offers":[130],"better":[131],"flexibility":[132],"handling":[134],"such":[135],"scheduling":[136],"problems,":[137],"we":[138,166],"focus":[139],"this":[141,190],"paper":[142,191,208],"on":[143],"using":[144,164],"an":[145],"answer":[146,195],"set":[147,196],"solver":[148,197],"both":[150],"generation.":[158],"major":[161],"benefit":[162],"ASP,":[165],"able":[168],"all":[171],"given":[176],"program":[177],"which":[178],"allows":[179],"one":[180],"study":[182],"properties.":[184],"Furthermore,":[185],"experimental":[187],"results":[188],"demonstrate":[192],"compete":[199],"outperforms":[204],"solvers.":[206],"This":[207],"under":[210],"consideration":[211],"acceptance":[213],"TPLP":[215],".":[216]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}