{"id":"https://openalex.org/W2134013881","doi":"https://doi.org/10.1109/coginf.2008.4639177","title":"Superblock scheduling using genetic programming for embedded systems","display_name":"Superblock scheduling using genetic programming for embedded systems","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2134013881","doi":"https://doi.org/10.1109/coginf.2008.4639177","mag":"2134013881"},"language":"en","primary_location":{"id":"doi:10.1109/coginf.2008.4639177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2008.4639177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 7th IEEE International Conference on Cognitive Informatics","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/A5091378651","display_name":"Anjali Mahajan","orcid":"https://orcid.org/0000-0002-9885-8691"},"institutions":[{"id":"https://openalex.org/I4210146358","display_name":"Raisoni Group of Institutions","ror":"https://ror.org/03dp11s58","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210146358"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Anjali Mahajan","raw_affiliation_strings":["G H Raisoni College of Engineering, Nagpur, India","G H Raisoni Coll. of Eng., Nagpur"],"affiliations":[{"raw_affiliation_string":"G H Raisoni College of Engineering, Nagpur, India","institution_ids":["https://openalex.org/I4210146358"]},{"raw_affiliation_string":"G H Raisoni Coll. of Eng., Nagpur","institution_ids":["https://openalex.org/I4210146358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056677620","display_name":"Mazhar Ali","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. S. Ali","raw_affiliation_strings":["PRM Institute of Technology, Badnera, India"],"affiliations":[{"raw_affiliation_string":"PRM Institute of Technology, Badnera, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091378651"],"corresponding_institution_ids":["https://openalex.org/I4210146358"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.10295529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization 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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9954000115394592,"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.8454381227493286},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.7881449460983276},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6597390174865723},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.594663679599762},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5868581533432007},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5494569540023804},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.510819673538208},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5001440048217773},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4811519384384155},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41715207695961},{"id":"https://openalex.org/keywords/pipeline-transport","display_name":"Pipeline transport","score":0.411205530166626},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4005689024925232},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20875993371009827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15616470575332642},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11750933527946472},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06355816125869751},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.06265276670455933}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8454381227493286},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.7881449460983276},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6597390174865723},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.594663679599762},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5868581533432007},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5494569540023804},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.510819673538208},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5001440048217773},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4811519384384155},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41715207695961},{"id":"https://openalex.org/C175309249","wikidata":"https://www.wikidata.org/wiki/Q725864","display_name":"Pipeline transport","level":2,"score":0.411205530166626},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4005689024925232},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20875993371009827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15616470575332642},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11750933527946472},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06355816125869751},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.06265276670455933},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C87717796","wikidata":"https://www.wikidata.org/wiki/Q146326","display_name":"Environmental engineering","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/coginf.2008.4639177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2008.4639177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 7th IEEE International Conference on Cognitive Informatics","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":22,"referenced_works":["https://openalex.org/W200613212","https://openalex.org/W298939433","https://openalex.org/W1860727798","https://openalex.org/W1915356570","https://openalex.org/W2019253475","https://openalex.org/W2069641426","https://openalex.org/W2081211681","https://openalex.org/W2099956623","https://openalex.org/W2106563495","https://openalex.org/W2119537359","https://openalex.org/W2137296754","https://openalex.org/W2146198043","https://openalex.org/W2153534571","https://openalex.org/W2158703918","https://openalex.org/W2493869930","https://openalex.org/W4232820030","https://openalex.org/W4233965375","https://openalex.org/W4285719527","https://openalex.org/W6608206018","https://openalex.org/W6610678337","https://openalex.org/W6678055996","https://openalex.org/W6680703539"],"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/W181259032","https://openalex.org/W1562291658"],"abstract_inverted_index":{"Instruction":[0],"scheduling":[1,15,37,65,109],"is":[2,17,39,89,111],"an":[3,23],"important":[4],"issue":[5],"in":[6,31],"the":[7,33,56,74,81,87,93,102],"compiler":[8,59],"optimization":[9],"for":[10],"embedded":[11],"systems.":[12],"The":[13,44],"instruction":[14,64,108],"problem":[16,34,104],"mainly":[18],"solved":[19],"heuristically":[20],"since":[21],"finding":[22],"optimal":[24],"solution":[25],"requires":[26],"significant":[27],"computational":[28],"resources":[29],"and,":[30],"general,":[32],"of":[35,46,78,86,96,105],"optimally":[36],"instructions":[38],"known":[40],"to":[41,61,71,92],"be":[42],"NP-Complete.":[43],"development":[45],"processors":[47],"with":[48],"pipelines":[49,85],"and":[50,84],"multiple":[51],"functional":[52,82],"units":[53,83],"has":[54],"increased":[55,94],"demands":[57],"on":[58],"writers":[60],"write":[62],"complex":[63],"algorithms.":[66],"These":[67],"algorithms":[68],"are":[69],"required":[70],"ensure":[72],"that":[73],"most":[75],"efficient":[76],"use":[77],"resources,":[79],"i.e.":[80],"processor,":[88],"made":[90],"due":[91],"complexity":[95],"processor":[97],"architectures.":[98],"In":[99],"this":[100],"paper,":[101],"specific":[103],"automatically":[106],"creating":[107],"heuristics":[110],"addressed.":[112]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}