{"id":"https://openalex.org/W7140753793","doi":"https://doi.org/10.1109/fpl68686.2025.00037","title":"Improving Boolean Satisfiability-Based Modulo Scheduling","display_name":"Improving Boolean Satisfiability-Based Modulo Scheduling","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W7140753793","doi":"https://doi.org/10.1109/fpl68686.2025.00037"},"language":null,"primary_location":{"id":"doi:10.1109/fpl68686.2025.00037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpl68686.2025.00037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 35th International Conference on Field-Programmable Logic and Applications (FPL)","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/A5034328761","display_name":"Nicolai Fiege","orcid":"https://orcid.org/0000-0002-4357-2119"},"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":"Nicolai Fiege","raw_affiliation_strings":["University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany"],"affiliations":[{"raw_affiliation_string":"University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002067478","display_name":"Peter Zipf","orcid":"https://orcid.org/0000-0003-4725-4246"},"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":"Peter Zipf","raw_affiliation_strings":["University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany"],"affiliations":[{"raw_affiliation_string":"University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034328761"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79188676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"204","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.45660001039505005,"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/T10142","display_name":"Formal Methods in Verification","score":0.45660001039505005,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.16580000519752502,"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.037700001150369644,"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/scheduling","display_name":"Scheduling (production processes)","score":0.4936999976634979},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4239000082015991},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4205999970436096},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.39750000834465027},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.3425000011920929},{"id":"https://openalex.org/keywords/standard-boolean-model","display_name":"Standard Boolean model","score":0.3012000024318695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6523000001907349},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43309998512268066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42399999499320984},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.39750000834465027},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.3425000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30660000443458557},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.30219998955726624},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.3012000024318695},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.2921999990940094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2865000069141388},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.2655999958515167}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpl68686.2025.00037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpl68686.2025.00037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 35th International Conference on Field-Programmable Logic and Applications (FPL)","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":27,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1587799811","https://openalex.org/W2012114780","https://openalex.org/W2014176439","https://openalex.org/W2028745274","https://openalex.org/W2030898836","https://openalex.org/W2054652902","https://openalex.org/W2057807751","https://openalex.org/W2071189607","https://openalex.org/W2095381673","https://openalex.org/W2099124997","https://openalex.org/W2123412205","https://openalex.org/W2154209875","https://openalex.org/W2168922271","https://openalex.org/W2530146034","https://openalex.org/W2788447492","https://openalex.org/W2803043552","https://openalex.org/W2904519236","https://openalex.org/W2943915040","https://openalex.org/W2945676406","https://openalex.org/W2967111204","https://openalex.org/W3003926237","https://openalex.org/W3130502810","https://openalex.org/W4246009290","https://openalex.org/W4321637214","https://openalex.org/W4381281730","https://openalex.org/W4404637342"],"related_works":[],"abstract_inverted_index":{"Modulo":[0],"scheduling":[1,26,45],"is":[2],"a":[3,48,97,112],"highly":[4],"effective":[5],"approach":[6,41,64],"for":[7,35,87,100],"maximizing":[8],"throughput":[9],"in":[10,25],"loops":[11],"with":[12,116],"static":[13],"memory":[14],"dependencies,":[15],"interleaving":[16],"computations":[17],"across":[18],"consecutive":[19],"loop":[20],"iterations.":[21],"Despite":[22],"substantial":[23],"advancements":[24],"procedures,":[27],"it":[28],"remains":[29],"the":[30,43,57,71,101,105],"most":[31],"computationally":[32],"intensive":[33],"phase":[34],"high-level":[36],"synthesis":[37],"flows.":[38],"A":[39],"recent":[40],"encodes":[42],"modulo":[44,89],"problem":[46],"as":[47],"series":[49],"of":[50,59,73,107,135],"Boolean":[51],"satisfiability":[52],"(SAT)":[53],"instances,":[54],"capitalizing":[55],"on":[56],"efficiency":[58],"modern":[60],"SAT":[61,114],"solvers.":[62],"This":[63,82],"significantly":[65],"reduces":[66],"solving":[67],"time":[68],"and":[69,110,137],"increases":[70],"availability":[72],"throughput-optimal":[74,136],"solutions":[75],"compared":[76],"to":[77,94,131],"integer":[78],"linear":[79],"programming-based":[80],"algorithms.":[81],"work":[83],"introduces":[84],"two":[85],"enhancements":[86],"SAT-based":[88],"scheduling:":[90],"(i)":[91],"an":[92,132],"algorithm":[93],"rapidly":[95],"calculate":[96],"lower":[98],"bound":[99],"schedule":[102],"length,":[103],"improving":[104],"identification":[106],"latency-optimal":[108,138],"schedules;":[109],"(ii)":[111],"streamlined":[113],"formulation":[115],"fewer":[117],"clauses,":[118],"facilitating":[119],"quicker":[120],"solver":[121],"decisions.":[122],"Extensive":[123],"experimental":[124],"evaluations":[125],"show":[126],"that":[127],"these":[128],"improvements":[129],"lead":[130],"increased":[133],"number":[134],"solutions.":[139]},"counts_by_year":[],"updated_date":"2026-03-28T06:11:35.319607","created_date":"2026-03-27T00:00:00"}