{"id":"https://openalex.org/W2131900104","doi":"https://doi.org/10.1109/ipdps.2004.1303080","title":"Synthesis of pipelined systems for the contemporaneous execution of periodic and aperiodic tasks with hard real-time constraints","display_name":"Synthesis of pipelined systems for the contemporaneous execution of periodic and aperiodic tasks with hard real-time constraints","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2131900104","doi":"https://doi.org/10.1109/ipdps.2004.1303080","mag":"2131900104"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5069833889","display_name":"Paolo Palazzari","orcid":"https://orcid.org/0009-0003-2569-263X"},"institutions":[{"id":"https://openalex.org/I110120368","display_name":"National Agency for New Technologies, Energy and Sustainable Economic Development","ror":"https://ror.org/02an8es95","country_code":"IT","type":"funder","lineage":["https://openalex.org/I110120368"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"P. Palazzari","raw_affiliation_strings":["ENEA-Computing and Modelling Unit, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"ENEA-Computing and Modelling Unit, Rome, Italy","institution_ids":["https://openalex.org/I110120368"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089593378","display_name":"Lucia Baldini","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Baldini","raw_affiliation_strings":["Electronic Engineering, University of Roma La Sapienza, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Electronic Engineering, University of Roma La Sapienza, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025576570","display_name":"M. Coli","orcid":"https://orcid.org/0000-0002-5002-8955"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Coli","raw_affiliation_strings":["Electronic Engineering, University of Roma La Sapienza, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Electronic Engineering, University of Roma La Sapienza, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069833889"],"corresponding_institution_ids":["https://openalex.org/I110120368"],"apc_list":null,"apc_paid":null,"fwci":1.8431,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85227718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"220","issue":null,"first_page":"121","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9980000257492065,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9980000257492065,"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.9975000023841858,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9965999722480774,"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/aperiodic-graph","display_name":"Aperiodic graph","score":0.9484884738922119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7670015096664429},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6352829933166504},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5592554807662964},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5536363124847412},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.532078742980957},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4403691291809082},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4386633038520813},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42006585001945496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38112711906433105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36785465478897095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16962364315986633},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11836925148963928},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11247330904006958}],"concepts":[{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.9484884738922119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7670015096664429},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6352829933166504},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5592554807662964},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5536363124847412},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.532078742980957},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4403691291809082},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4386633038520813},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42006585001945496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38112711906433105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36785465478897095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16962364315986633},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11836925148963928},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11247330904006958},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1303080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2018113144","https://openalex.org/W2024060531","https://openalex.org/W2024672209","https://openalex.org/W2095409492","https://openalex.org/W2100596926","https://openalex.org/W2112575418","https://openalex.org/W2117169918","https://openalex.org/W2126818571","https://openalex.org/W2129603047","https://openalex.org/W2140585279","https://openalex.org/W2143994348","https://openalex.org/W2165460745","https://openalex.org/W3139994238","https://openalex.org/W4239092655","https://openalex.org/W4243459916","https://openalex.org/W6679529532"],"related_works":["https://openalex.org/W169104718","https://openalex.org/W2020479294","https://openalex.org/W2771208101","https://openalex.org/W1508060631","https://openalex.org/W2022006488","https://openalex.org/W1901015702","https://openalex.org/W2471627750","https://openalex.org/W2434525066","https://openalex.org/W2130555437","https://openalex.org/W3023290810"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3,93],"We":[4],"address":[5],"the":[6,14,23,41,44,52,55,60,64,68,71,86,89,104,116,130,134,154,160],"design":[7,53],"of":[8,16,43,54,67,73,79,88,141],"pipelined":[9,131],"systems":[10],"able":[11],"to":[12,26,58,70,150],"sustain":[13],"throughput":[15],"a":[17,81,100,109,127,142],"given":[18,149],"periodic":[19,61],"task":[20],"and,":[21],"at":[22],"same":[24],"time,":[25],"serve":[27],"aperiodic":[28,49,74],"requests":[29],"associated":[30],"with":[31,85],"hard":[32],"real-time":[33,117],"constraints.":[34],"The":[35,94],"proposed":[36],"method":[37],"is":[38,92,97,148],"based":[39],"on":[40],"allocation":[42],"global":[45],"graph":[46],"(periodic":[47],"and":[48,119,133],"tasks),":[50],"over-dimensioning":[51],"system":[56],"devoted":[57],"process":[59,106],"task,":[62],"deserving":[63],"unused":[65],"parts":[66],"resources":[69],"management":[72],"requests.":[75],"A":[76,146],"formal":[77],"definition":[78],"such":[80,102],"mapping":[82],"problem,":[83,129],"together":[84],"formalization":[87],"searching":[90,95],"space,":[91],"space":[96],"structured":[98],"in":[99,159],"way":[101],"as":[103,126],"minimization":[105,128],"moves":[107],"toward":[108],"solution,":[110],"which":[111],"satisfies,":[112],"if":[113],"possible,":[114],"all":[115,153],"constraints":[118],"has":[120],"minimal":[121],"HW":[122],"requirements.":[123],"Once":[124],"formulated":[125],"architecture":[132],"corresponding":[135],"scheduling":[136],"are":[137,157],"determined":[138],"by":[139],"means":[140],"simulated":[143],"annealing":[144],"algorithm.":[145],"theorem":[147],"ensure":[151],"that":[152],"feasible":[155],"mappings":[156],"reachable":[158],"optimization":[161],"process.":[162]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}