{"id":"https://openalex.org/W2067984358","doi":"https://doi.org/10.1109/etfa.2010.5641282","title":"A flexible tool for evaluating scheduling, synchronization and partitioning algorithms on multiprocessors","display_name":"A flexible tool for evaluating scheduling, synchronization and partitioning algorithms on multiprocessors","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2067984358","doi":"https://doi.org/10.1109/etfa.2010.5641282","mag":"2067984358"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2010.5641282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2010.5641282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","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/A5065490699","display_name":"Farhang Nemati","orcid":null},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"F Nemati","raw_affiliation_strings":["M\u00e4lardalen Real-Time Research Centre, Vasteras, Sweden","M\u00e4lardalen Real-Time Research Centre, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047385412","display_name":"Thomas Nolte","orcid":"https://orcid.org/0000-0001-6132-7945"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"T Nolte","raw_affiliation_strings":["M\u00e4lardalen Real-Time Research Centre, Vasteras, Sweden","M\u00e4lardalen Real-Time Research Centre, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065490699"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13163727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980000257492065,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8680316209793091},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6309900283813477},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6163172125816345},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4928770065307617},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.49220195412635803},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.48509299755096436},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.48202431201934814},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4589240849018097},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.44304993748664856},{"id":"https://openalex.org/keywords/shared-resource","display_name":"Shared resource","score":0.4406542479991913},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.1984296441078186},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10431724786758423},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0995296835899353},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08839017152786255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0675491988658905}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8680316209793091},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6309900283813477},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6163172125816345},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4928770065307617},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49220195412635803},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.48509299755096436},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.48202431201934814},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4589240849018097},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.44304993748664856},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.4406542479991913},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.1984296441078186},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10431724786758423},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0995296835899353},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08839017152786255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0675491988658905},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2010.5641282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2010.5641282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4399999976158142,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W125981586","https://openalex.org/W640852586","https://openalex.org/W1507996685","https://openalex.org/W1548943549","https://openalex.org/W1565490483","https://openalex.org/W1664327184","https://openalex.org/W1994229821","https://openalex.org/W2019745154","https://openalex.org/W2042352414","https://openalex.org/W2093100591","https://openalex.org/W2100980563","https://openalex.org/W2118236818","https://openalex.org/W2126971814","https://openalex.org/W2143006785","https://openalex.org/W2156324992","https://openalex.org/W2160293203","https://openalex.org/W2164164245","https://openalex.org/W2170643076","https://openalex.org/W2397616328","https://openalex.org/W2406165237","https://openalex.org/W2477294255","https://openalex.org/W6712813235"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2106332846","https://openalex.org/W2372008037","https://openalex.org/W2397293317","https://openalex.org/W2978148977","https://openalex.org/W3036719625","https://openalex.org/W2545511463","https://openalex.org/W1545991362","https://openalex.org/W2167574351","https://openalex.org/W2225350526"],"abstract_inverted_index":{"Multi-core":[0],"platforms":[1],"seem":[2],"to":[3,35,41,72,91,121],"be":[4,42],"the":[5,13,17,20,112],"way":[6],"towards":[7],"increasing":[8],"performance":[9],"of":[10,69,86,94,99,104,111,117,126],"processors.":[11],"As":[12],"multi-cores":[14],"are":[15,52],"becoming":[16],"defacto":[18],"processors,":[19],"need":[21],"for":[22,65,84,107],"new":[23],"scheduling":[24],"and":[25,49,67,75,102,119,124],"resource":[26],"sharing":[27],"protocols":[28],"has":[29],"arisen.":[30],"However,":[31],"taking":[32],"such":[33,44,96],"technology":[34],"an":[36],"industrial":[37],"setting,":[38],"it":[39],"needs":[40],"evaluated":[43],"that":[45],"appropriate":[46],"scheduling,":[47,73],"synchronization":[48,74],"partitioning":[50],"algorithms":[51],"selected.":[53],"In":[54],"this":[55],"paper":[56],"we":[57],"present":[58],"our":[59],"ongoing":[60],"work":[61],"on":[62,78],"a":[63,92,115],"tool":[64,82,113],"investigation":[66],"evaluation":[68,123],"different":[70,87,127],"approaches":[71,88],"task":[76],"allocation":[77],"multi-core":[79],"platforms.":[80],"Our":[81],"allows":[83],"comparison":[85,125],"with":[89],"respect":[90],"number":[93,98,103],"parameters":[95],"as":[97],"schedulable":[100],"systems":[101],"processors":[105],"required":[106],"scheduling.":[108],"The":[109],"output":[110],"includes":[114],"set":[116],"information":[118],"graphs":[120],"facilitate":[122],"approaches.":[128]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}