{"id":"https://openalex.org/W2360731207","doi":"https://doi.org/10.1145/2906363.2906380","title":"Machine Learning Approach to Generate Pareto Front for List-scheduling Algorithms","display_name":"Machine Learning Approach to Generate Pareto Front for List-scheduling Algorithms","publication_year":2016,"publication_date":"2016-05-13","ids":{"openalex":"https://openalex.org/W2360731207","doi":"https://doi.org/10.1145/2906363.2906380","mag":"2360731207"},"language":"en","primary_location":{"id":"doi:10.1145/2906363.2906380","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2906363.2906380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems","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/A5019464351","display_name":"Nam Khanh Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I144291393","display_name":"Data Storage Institute","ror":"https://ror.org/03k5xes38","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I144291393"]},{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Nam Khanh Pham","raw_affiliation_strings":["ECE Department, NUS Data Storage Institute (DSI), A * STAR, Singapore"],"affiliations":[{"raw_affiliation_string":"ECE Department, NUS Data Storage Institute (DSI), A * STAR, Singapore","institution_ids":["https://openalex.org/I144291393","https://openalex.org/I115228651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100755285","display_name":"Akash Kumar","orcid":"https://orcid.org/0000-0001-7125-1737"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Akash Kumar","raw_affiliation_strings":["Center for Advancing Electronics Dresden (cfaed), TU Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Center for Advancing Electronics Dresden (cfaed), TU Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058648309","display_name":"Khin Mi Mi Aung","orcid":"https://orcid.org/0000-0002-5652-3455"},"institutions":[{"id":"https://openalex.org/I144291393","display_name":"Data Storage Institute","ror":"https://ror.org/03k5xes38","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I144291393"]},{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Khin Mi Mi Aung","raw_affiliation_strings":["Data Storage Institute (DSI), A * STAR, Singapore"],"affiliations":[{"raw_affiliation_string":"Data Storage Institute (DSI), A * STAR, Singapore","institution_ids":["https://openalex.org/I144291393","https://openalex.org/I115228651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019464351"],"corresponding_institution_ids":["https://openalex.org/I115228651","https://openalex.org/I144291393"],"apc_list":null,"apc_paid":null,"fwci":0.2895,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60991887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9986000061035156,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9954000115394592,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9948999881744385,"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.805912971496582},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6004247069358826},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5302730798721313},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5005252361297607},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.48423266410827637},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4195820093154907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41841864585876465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32503098249435425},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2579386830329895},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.250171959400177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08745494484901428}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.805912971496582},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6004247069358826},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5302730798721313},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5005252361297607},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.48423266410827637},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4195820093154907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41841864585876465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32503098249435425},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2579386830329895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.250171959400177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08745494484901428},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2906363.2906380","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2906363.2906380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems","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":23,"referenced_works":["https://openalex.org/W1480376833","https://openalex.org/W1497586388","https://openalex.org/W1892383984","https://openalex.org/W1967183647","https://openalex.org/W1973531467","https://openalex.org/W1973798274","https://openalex.org/W2034919502","https://openalex.org/W2046964432","https://openalex.org/W2049624433","https://openalex.org/W2096875061","https://openalex.org/W2111129781","https://openalex.org/W2117706453","https://openalex.org/W2125676180","https://openalex.org/W2132576681","https://openalex.org/W2135974394","https://openalex.org/W2138403270","https://openalex.org/W2142386205","https://openalex.org/W2143169838","https://openalex.org/W2159445486","https://openalex.org/W2160642098","https://openalex.org/W2171865075","https://openalex.org/W2547690942","https://openalex.org/W2582743722"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W1550055091","https://openalex.org/W2744462909","https://openalex.org/W1971520370"],"abstract_inverted_index":{"List":[0],"Scheduling":[1],"is":[2,25],"one":[3,76],"of":[4,31,54,62,93,105,156,186],"the":[5,29,57,63,91,100,123,129,148,153,190,198],"most":[6,61],"widely":[7],"used":[8,26,142],"techniques":[9,140],"for":[10,78,127,147,176],"scheduling":[11],"due":[12],"to":[13,27,50,89,98,121,143,151],"its":[14],"simplicity":[15],"and":[16,33,47,132,167],"efficiency.":[17],"In":[18],"traditional":[19,191],"list-based":[20,65],"schedulers,":[21],"a":[22,68,103,119],"cost/priority":[23],"function":[24,42,71],"compute":[28],"priority":[30,70],"tasks/jobs":[32],"put":[34],"them":[35],"in":[36,56,182,197],"an":[37],"ordered":[38],"list.":[39],"The":[40,158,173],"cost":[41],"has":[43],"been":[44],"becoming":[45],"more":[46,48],"complex":[49],"cover":[51],"increasing":[52],"number":[53,104],"constraints":[55],"system":[58,94],"design.":[59],"However,":[60],"existing":[64],"schedulers":[66],"implement":[67],"static":[69],"that":[72],"usually":[73],"provides":[74],"only":[75,194],"schedule":[77],"each":[79],"task":[80,164,171,178],"graph":[81,165],"input.":[82],"Therefore,":[83],"they":[84],"may":[85],"not":[86],"be":[87],"able":[88],"satisfy":[90],"desire":[92],"designers,":[95],"who":[96],"want":[97],"examine":[99],"trade-off":[101],"between":[102],"design":[106,130,135],"requirements":[107],"(performance,":[108],"power,":[109],"energy,":[110],"reliability":[111],"...).":[112],"To":[113],"address":[114],"this":[115],"problem,":[116],"we":[117],"propose":[118],"framework":[120],"utilize":[122],"Genetic":[124],"Algorithm":[125],"(GA)":[126],"exploring":[128],"space":[131],"obtaining":[133],"Pareto-optimal":[134],"points.":[136],"Furthermore,":[137],"multiple":[138],"regression":[139],"are":[141,160,180],"build":[144],"predictive":[145],"models":[146,159],"Pareto":[149,174],"fronts":[150,175],"limit":[152],"execution":[154],"time":[155,183],"GA.":[157],"built":[161],"using":[162],"training":[163],"datasets":[166],"applied":[168],"on":[169],"incoming":[170,177],"graphs.":[172],"graphs":[179],"produced":[181],"2":[184],"orders":[185],"magnitude":[187],"faster":[188],"than":[189],"GA,":[192],"with":[193],"4%":[195],"degradation":[196],"quality.":[199]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}