{"id":"https://openalex.org/W1520175292","doi":null,"title":"Efficient Algorithms for Cyclic Scheduling","display_name":"Efficient Algorithms for Cyclic Scheduling","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W1520175292","mag":"1520175292"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.6904","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.nyu.edu/pub/tech-reports/./tr571.ps.Z","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5000494264","display_name":"Franco Gasperoni","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franco Gasperoni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057886883","display_name":"Uwe Schwiegelshohn A","orcid":"https://orcid.org/0000-0002-3582-4961","observed_orcids":["https://orcid.org/0000-0002-3582-4961"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uwe Schwiegelshohn","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3582-4961","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9362,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.8541979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5015000104904175,"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.5015000104904175,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.24300000071525574,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.10109999775886536,"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/cyclic-scheduling","display_name":"cyclic scheduling","score":0.9940000176429749},{"id":"https://openalex.org/keywords/non-preemptive-scheduling","display_name":"non-preemptive scheduling","score":0.9779999852180481},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.5820000171661377},{"id":"https://openalex.org/keywords/identical-processors","display_name":"identical processors","score":0.671999990940094},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7429999709129333},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9039999842643738},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9070000052452087},{"id":"https://openalex.org/keywords/parallel-programming-languages","display_name":"parallel programming languages","score":0.5249999761581421}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538930356502533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5086454153060913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3202098608016968}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.6904","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.nyu.edu/pub/tech-reports/./tr571.ps.Z","raw_type":"text"},{"id":"mag:1520175292","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=890313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"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/W1482980362","https://openalex.org/W2160757927","https://openalex.org/W3192410790","https://openalex.org/W7095998560","https://openalex.org/W7095173023","https://openalex.org/W7131098457","https://openalex.org/W142941958","https://openalex.org/W2040414745","https://openalex.org/W2725890996","https://openalex.org/W2159734010"],"abstract_inverted_index":{"This":[0],"work":[1],"addresses":[2],"the":[3,45,117,129],"problem":[4,46],"of":[5,11,53,70,78,83,125,143],"non-preemptively":[6],"scheduling":[7],"a":[8,17,32,50,122],"cyclic":[9],"set":[10],"interdependent":[12],"operations,":[13],"representing":[14],"for":[15],"instance":[16],"program":[18],"loop,":[19],"when":[20],"p":[21,27,42],"identical":[22],"processors":[23],"are":[24,103,112],"available.":[25],"For":[26],"=":[28],"1":[29,44,62],"we":[30],"give":[31],"simple,":[33],"efficient,":[34],"polynomial":[35],"time":[36],"algorithm":[37,55],"producing":[38],"optimum":[39,60],"results.":[40,61],"When":[41],"!":[43],"becomes":[47],"NP-hard":[48],"and":[49,111],"slight":[51],"modification":[52],"our":[54],"generates":[56],"provably":[57],"close":[58],"to":[59,88,106,133],"Introduction":[63],"With":[64],"advances":[65],"in":[66],"hardware":[67],"technology":[68],"most":[69],"todays":[71],"high":[72,137,141],"performance":[73,138],"computers":[74],"offer":[75],"some":[76,107],"degree":[77],"parallelism.":[79],"To":[80],"take":[81],"advantage":[82],"this":[84],"concurrency,":[85],"parallel":[86,109],"extensions":[87,96],"sequential":[89,126],"programming":[90],"languages":[91],"have":[92,97],"been":[93],"designed.":[94],"Such":[95],"mostly":[98],"proved":[99],"inadequate":[100],"as":[101],"they":[102],"usually":[104],"tailored":[105],"underlying":[108],"architecture":[110],"consequently":[113],"not":[114],"portable.":[115],"On":[116],"other":[118],"hand":[119],"there":[120],"is":[121],"large":[123],"amount":[124],"applications":[127],"that":[128],"users":[130],"would":[131],"like":[132],"run":[134],"on":[135],"these":[136],"computers.":[139],"The":[140],"cost":[142],"machine":[144],"specific":[145],"software":[146],"developm...":[147]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}