{"id":"https://openalex.org/W2134195081","doi":"https://doi.org/10.1109/tpds.2002.1041877","title":"Sequential and parallel cellular automata-based scheduling algorithms","display_name":"Sequential and parallel cellular automata-based scheduling algorithms","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2134195081","doi":"https://doi.org/10.1109/tpds.2002.1041877","mag":"2134195081"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2002.1041877","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1041877","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-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/A5087256698","display_name":"Franciszek Seredy\u0144ski","orcid":"https://orcid.org/0000-0003-0206-8183"},"institutions":[{"id":"https://openalex.org/I3017851245","display_name":"Polish-Japanese Academy of Information Technology","ror":"https://ror.org/01v542j61","country_code":"PL","type":"education","lineage":["https://openalex.org/I3017851245"]},{"id":"https://openalex.org/I99542240","display_name":"Polish Academy of Sciences","ror":"https://ror.org/01dr6c206","country_code":"PL","type":"funder","lineage":["https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"F. Seredynski","raw_affiliation_strings":["Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland","Polish Japanese Institute of Information Technology, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland","institution_ids":["https://openalex.org/I99542240","https://openalex.org/I4210087266"]},{"raw_affiliation_string":"Polish Japanese Institute of Information Technology, Warsaw, Poland","institution_ids":["https://openalex.org/I3017851245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015993565","display_name":"Albert Y. Zomaya","orcid":"https://orcid.org/0000-0002-3090-1059"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A.Y. Zomaya","raw_affiliation_strings":["School of Information Technologies, University of Sydney, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technologies, University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087256698"],"corresponding_institution_ids":["https://openalex.org/I3017851245","https://openalex.org/I4210087266","https://openalex.org/I99542240"],"apc_list":null,"apc_paid":null,"fwci":0.3388,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.59432019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"10","first_page":"1009","last_page":"1023"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9866999983787537,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9815999865531921,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.871597170829773},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.6350911259651184},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5645029544830322},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5563406944274902},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.49115750193595886},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4850746691226959},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.47024956345558167},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4311884045600891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.408361554145813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4066939949989319},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33025452494621277},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3093355894088745},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.28773069381713867},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.23232528567314148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.077114999294281}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.871597170829773},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.6350911259651184},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5645029544830322},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5563406944274902},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.49115750193595886},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4850746691226959},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.47024956345558167},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4311884045600891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.408361554145813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4066939949989319},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33025452494621277},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3093355894088745},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.28773069381713867},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.23232528567314148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.077114999294281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2002.1041877","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1041877","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W38218484","https://openalex.org/W200355080","https://openalex.org/W419065232","https://openalex.org/W1481272997","https://openalex.org/W1486536565","https://openalex.org/W1493255904","https://openalex.org/W1498507866","https://openalex.org/W1498880886","https://openalex.org/W1503979119","https://openalex.org/W1524706847","https://openalex.org/W1525511955","https://openalex.org/W1551186452","https://openalex.org/W1552658865","https://openalex.org/W1574029387","https://openalex.org/W1575231869","https://openalex.org/W1639032689","https://openalex.org/W1901611666","https://openalex.org/W1963702647","https://openalex.org/W1969031395","https://openalex.org/W2001109406","https://openalex.org/W2009356031","https://openalex.org/W2011039300","https://openalex.org/W2019356799","https://openalex.org/W2023753260","https://openalex.org/W2043331236","https://openalex.org/W2117564498","https://openalex.org/W2121719389","https://openalex.org/W2122698508","https://openalex.org/W2141306950","https://openalex.org/W2142183404","https://openalex.org/W2144482271","https://openalex.org/W2145377593","https://openalex.org/W2150532704","https://openalex.org/W2163109311","https://openalex.org/W2475725195","https://openalex.org/W2503208088","https://openalex.org/W2529761095","https://openalex.org/W2625983909","https://openalex.org/W3023540311","https://openalex.org/W4205794590","https://openalex.org/W4252777150","https://openalex.org/W4285719527","https://openalex.org/W4301914497","https://openalex.org/W6631485395","https://openalex.org/W6678016301","https://openalex.org/W6727687505"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W45821419","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2159634855","https://openalex.org/W2186708011","https://openalex.org/W2131328519","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W1994519856"],"abstract_inverted_index":{"We":[0,20,129],"present":[1,130],"an":[2],"approach":[3],"to":[4,31,38,53,124],"designing":[5],"cellular":[6,35,64,83,97,109,149],"automata-based":[7,65,150],"multiprocessor":[8,27],"scheduling":[9,17,141,151],"algorithms":[10,142],"in":[11,68,106,144],"which":[12],"extracting":[13],"knowledge":[14],"about":[15],"the":[16,22,54,90,145],"process":[18],"occurs.":[19],"consider":[21],"simplest":[23],"case":[24],"when":[25],"a":[26,39,45,87,131,148],"system":[28],"is":[29],"limited":[30],"two-processors.":[32],"To":[33,103],"design":[34,125],"automata":[36,84,98,110],"corresponding":[37],"given":[40],"program":[41,49,61],"graph,":[42],"we":[43,112],"propose":[44,113],"generic":[46],"definition":[47],"of":[48,60,96,133,147],"graph":[50],"neighborhood,":[51],"transparent":[52],"various":[55],"kinds,":[56],"sizes,":[57],"and":[58,73,93,139],"shapes":[59],"graphs.":[62],"The":[63],"scheduler":[66],"works":[67],"two":[69],"modes:":[70],"learning":[71],"mode":[72],"operation":[74],"mode.":[75],"Discovered":[76,118],"rules":[77,121],"are":[78,99],"typically":[79],"suitable":[80],"for":[81,136],"sequential":[82,138],"working":[85],"as":[86],"scheduler,":[88],"while":[89],"most":[91],"interesting":[92],"promising":[94],"feature":[95],"their":[100],"massive":[101],"parallelism.":[102],"overcome":[104],"difficulties":[105],"evolving":[107],"parallel":[108,127,140],"rules,":[111],"using":[114],"coevolutionary":[115],"genetic":[116],"algorithm.":[117],"this":[119],"way,":[120],"enable":[122],"us":[123],"effective":[126],"schedulers.":[128],"number":[132],"experimental":[134],"results":[135],"both":[137],"discovered":[143],"context":[146],"system.":[152]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}