{"id":"https://openalex.org/W2612403598","doi":"https://doi.org/10.1142/s012905411850003x","title":"A Family of Scheduling Algorithms for Hybrid Parallel Platforms","display_name":"A Family of Scheduling Algorithms for Hybrid Parallel Platforms","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2612403598","doi":"https://doi.org/10.1142/s012905411850003x","mag":"2612403598"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411850003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411850003x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5010204007","display_name":"Safia Kedad\u2010Sidhoum","orcid":"https://orcid.org/0000-0002-2184-2261"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'Etudes et De Recherche en Informatique et Communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210145724"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Safia Kedad-Sidhoum","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, F-75005, Paris, France","CEDRIC. Optimisation Combinatoire"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, F-75005, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]},{"raw_affiliation_string":"CEDRIC. Optimisation Combinatoire","institution_ids":["https://openalex.org/I4210145724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000423937","display_name":"Florence Monna","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Florence Monna","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, F-75005, Paris, France"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, F-75005, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086790943","display_name":"Gr\u00e9gory Mouni\u00e9","orcid":"https://orcid.org/0000-0002-6757-7432"},"institutions":[{"id":"https://openalex.org/I4210147095","display_name":"Aware (United States)","ror":"https://ror.org/03w007e62","country_code":"US","type":"company","lineage":["https://openalex.org/I4210147095"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Gr\u00e9gory Mouni\u00e9","raw_affiliation_strings":["Universit\u00e9 Grenoble-Alpes, 655 avenue de l\u2019Europe, 38334 St Ismier cedex, France","Data Aware Large Scale Computing"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble-Alpes, 655 avenue de l\u2019Europe, 38334 St Ismier cedex, France","institution_ids":["https://openalex.org/I899635006"]},{"raw_affiliation_string":"Data Aware Large Scale Computing","institution_ids":["https://openalex.org/I4210147095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106430515","display_name":"Denis Trystram","orcid":null},"institutions":[{"id":"https://openalex.org/I4210147095","display_name":"Aware (United States)","ror":"https://ror.org/03w007e62","country_code":"US","type":"company","lineage":["https://openalex.org/I4210147095"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Denis Trystram","raw_affiliation_strings":["Universit\u00e9 Grenoble-Alpes, 655 avenue de l\u2019Europe, 38334 St Ismier cedex, France","Data Aware Large Scale Computing"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble-Alpes, 655 avenue de l\u2019Europe, 38334 St Ismier cedex, France","institution_ids":["https://openalex.org/I899635006"]},{"raw_affiliation_string":"Data Aware Large Scale Computing","institution_ids":["https://openalex.org/I4210147095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5010204007"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210145724","https://openalex.org/I4210159731"],"apc_list":null,"apc_paid":null,"fwci":1.0069,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80364506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"29","issue":"01","first_page":"63","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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.6985121965408325},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6386834383010864},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5649942755699158},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.558384120464325},{"id":"https://openalex.org/keywords/general-purpose-computing-on-graphics-processing-units","display_name":"General-purpose computing on graphics processing units","score":0.537681519985199},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.4377390146255493},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3871362805366516},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.3836174011230469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37421882152557373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24141743779182434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14462623000144958}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6985121965408325},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6386834383010864},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5649942755699158},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.558384120464325},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.537681519985199},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.4377390146255493},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3871362805366516},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.3836174011230469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37421882152557373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24141743779182434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14462623000144958},{"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},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s012905411850003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411850003x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01516700v1","is_oa":false,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-01516700","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 2018, 29 (1), pp.63-90. &#x27E8;10.1142/S012905411850003X&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1986282189","https://openalex.org/W2014071862","https://openalex.org/W2014369282","https://openalex.org/W2052586468","https://openalex.org/W2068718151","https://openalex.org/W2093979815","https://openalex.org/W2102201348","https://openalex.org/W2104680817","https://openalex.org/W2121893797","https://openalex.org/W2124859146","https://openalex.org/W2130631363","https://openalex.org/W2144597359","https://openalex.org/W2149294210","https://openalex.org/W2154305205","https://openalex.org/W2160900733"],"related_works":["https://openalex.org/W1963859303","https://openalex.org/W2364044215","https://openalex.org/W2389600408","https://openalex.org/W240129890","https://openalex.org/W3048701459","https://openalex.org/W2149078538","https://openalex.org/W2370314112","https://openalex.org/W1912958759","https://openalex.org/W2792081825","https://openalex.org/W2893308117"],"abstract_inverted_index":{"More":[0],"and":[1,15,43,128],"more":[2,215],"parallel":[3,36],"computing":[4],"platforms":[5],"are":[6,180],"built":[7],"upon":[8],"hybrid":[9,270],"architectures":[10],"combining":[11],"multi-core":[12],"processors":[13],"(CPUs)":[14],"hardware":[16],"accelerators":[17],"like":[18],"General":[19],"Purpose":[20],"Graphics":[21],"Processing":[22],"Units":[23],"(GPGPUs).":[24],"We":[25,67],"present":[26,97],"in":[27,187,234],"this":[28],"paper":[29],"a":[30,65,157,166,172,223,231,239,273],"new":[31],"method":[32,162,260],"for":[33,85,116,136,181,267,281],"scheduling":[34,72,268],"efficiently":[35],"applications":[37],"with":[38,78,238,272],"[Formula:":[39,44,73,109,113,119,129,133,137,142,188,192,206,235,244],"see":[40,45,74,110,114,120,130,134,138,143,189,193,207,236,245],"text]":[41,46,75,111,115,121,131,135,139,144,190,237],"CPUs":[42],"GPGPUs,":[47,140],"where":[48,141],"each":[49],"task":[50],"of":[51,71,100,108,156,197,204,226,243],"the":[52,69,79,83,87,153,182,202,209,211,214,217,227,253,262],"application":[53,89],"can":[54,104,278],"be":[55,279],"processed":[56],"either":[57],"on":[58,64,165,269],"an":[59,146],"usual":[60],"core":[61],"(CPU)":[62],"or":[63,112,132],"GPGPU.":[66],"consider":[68],"problem":[70,92],"independent":[76],"tasks":[77],"objective":[80],"to":[81,152,252],"minimize":[82],"time":[84,233],"completing":[86],"whole":[88],"(makespan).":[90],"This":[91,247],"is":[93,126,145,163,250,261],"NP-hard,":[94],"thus,":[95],"we":[96,221],"two":[98],"families":[99],"approximation":[101,106,168,241],"algorithms":[102],"that":[103,170,277],"achieve":[105],"ratios":[107],"any":[117],"integer":[118],"when":[122],"only":[123],"one":[124],"GPGPU":[125],"considered,":[127],"arbitrary":[147],"small":[148],"value":[149,203],"which":[150,229],"corresponds":[151],"target":[154],"accuracy":[155],"binary":[158],"search.":[159],"The":[160,176,200,257],"proposed":[161,258],"based":[164],"dual":[167,198],"scheme":[169],"uses":[171],"dynamic":[173],"programming":[174],"algorithm.":[175],"associated":[177],"computational":[178,218],"costs":[179],"first":[183,263],"(resp.":[184,191],"second)":[185],"family":[186],"text])":[194],"per":[195],"step":[196],"approximation.":[199],"greater":[201],"parameter":[205],"text],":[208],"better":[210],"approximation,":[212],"but":[213],"expensive":[216],"cost.":[219],"Finally,":[220],"propose":[222],"relaxed":[224],"version":[225],"algorithm":[228,255,266],"achieves":[230],"running":[232],"constant":[240],"bound":[242],"text].":[246],"last":[248],"result":[249],"compared":[251],"state-of-the-art":[254],"HEFT.":[256],"solving":[259],"general":[264],"purpose":[265],"machines":[271],"theoretical":[274],"performance":[275],"guarantee":[276],"used":[280],"practical":[282],"purposes.":[283]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
