{"id":"https://openalex.org/W2520091381","doi":"https://doi.org/10.1109/hpcsim.2016.7568329","title":"Scheduling binary tree-shaped task graphs representing optimal parenthesizations of dense-triangular matrix chain product","display_name":"Scheduling binary tree-shaped task graphs representing optimal parenthesizations of dense-triangular matrix chain product","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2520091381","doi":"https://doi.org/10.1109/hpcsim.2016.7568329","mag":"2520091381"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2016.7568329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","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/A5061849587","display_name":"Khaoula Bezzina","orcid":null},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Khaoula Bezzina","raw_affiliation_strings":["University of Tunis EI Manar, Faculty of Sciences of Tunis University Campus, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"University of Tunis EI Manar, Faculty of Sciences of Tunis University Campus, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032618988","display_name":"Zaher Mahjoub","orcid":null},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Zaher Mahjoub","raw_affiliation_strings":["University of Tunis EI Manar, Faculty of Sciences of Tunis University Campus, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"University of Tunis EI Manar, Faculty of Sciences of Tunis University Campus, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061849587"],"corresponding_institution_ids":["https://openalex.org/I108714496"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78905317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"27","issue":null,"first_page":"148","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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.6494470238685608},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5864081382751465},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5450333952903748},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4969487488269806},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4737045466899872},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43782514333724976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4344763159751892},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4222791790962219},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4192364513874054},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37391000986099243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2889040410518646},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10971406102180481}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6494470238685608},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5864081382751465},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5450333952903748},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4969487488269806},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4737045466899872},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43782514333724976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4344763159751892},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4222791790962219},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4192364513874054},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37391000986099243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2889040410518646},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10971406102180481},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2016.7568329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","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":15,"referenced_works":["https://openalex.org/W10380459","https://openalex.org/W1584476063","https://openalex.org/W1882278652","https://openalex.org/W2015006783","https://openalex.org/W2015106054","https://openalex.org/W2042051496","https://openalex.org/W2057913648","https://openalex.org/W2068067127","https://openalex.org/W2078795041","https://openalex.org/W2122579766","https://openalex.org/W2131932392","https://openalex.org/W2155463244","https://openalex.org/W2519807359","https://openalex.org/W4213172915","https://openalex.org/W6600427331"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2784269775","https://openalex.org/W2593735092","https://openalex.org/W2749663619"],"abstract_inverted_index":{"The":[0],"matrix":[1,103],"chain":[2,37,50,134],"product":[3,135],"(MCP)":[4],"problem":[5,12,47],"is":[6,122,181,227],"an":[7,31,87,141,230],"easy":[8],"well-known":[9],"combinatorial":[10],"optimization":[11],"that":[13],"has":[14,38],"many":[15],"real":[16],"world":[17],"applications.":[18],"We":[19,166],"address":[20],"in":[21,73,136,218],"this":[22,145,150],"paper":[23],"the":[24,28,36,46,49,77,83,105,110,113,117,126,133,184,222,242,246],"parallel":[25],"computing":[26,82,132],"of":[27,35,45,61,64,112,129,147,245],"MCP":[29],"once":[30],"optimal":[32,137,142],"parenthesization":[33],"(OP)":[34],"been":[39],"determined.":[40],"Considering":[41],"a":[42,62,93,102,157,169,200],"particular":[43],"variant":[44],"where":[48,97,178,192],"involves":[51],"square":[52],"dense":[53],"and":[54,162,188,213,240],"triangular":[55],"matrices,":[56],"we":[57,152,173],"first":[58,124],"make":[59],"use":[60],"series":[63],"linear":[65],"time":[66],"greedy":[67],"algorithms":[68],"for":[69,80,131,156],"determining":[70],"several":[71,208],"OPs":[72],"order":[74,219],"to":[75,101,123,183,220,234],"choose":[76],"more":[78],"adequate":[79],"efficiently":[81],"final":[84],"matrix.":[85],"Since":[86],"OP":[88],"may":[89,195],"be":[90,196],"represented":[91],"by":[92,154,229],"binary":[94],"in-tree":[95],"(BIT)":[96],"each":[98,179,193],"node":[99,190,194],"corresponds":[100],"product,":[104],"width":[106],"as":[107,109,199],"well":[108],"depth":[111,187],"BIT":[114,159,186],"are":[115],"among":[116],"choice":[118],"criteria.":[119],"Our":[120,225],"objective":[121],"determine":[125],"minimal":[127],"number":[128,146],"processors":[130],"time,":[138],"then":[139,167],"design":[140,174],"scheduling":[143,176,223],"using":[144],"processors.":[148],"For":[149],"purpose,":[151],"begin":[153],"constructing":[155],"given":[158],"its":[160,189],"earliest":[161],"latest":[163],"level":[164],"partitions.":[165],"derive":[168],"balanced":[170],"BIT.":[171],"Afterwards,":[172],"different":[175],"heuristics":[177],"one":[180],"related":[182],"obtained":[185],"costs,":[191],"either":[197],"considered":[198],"whole":[201],"(coarse":[202],"grain":[203,212,216],"case)":[204],"or":[205],"split":[206],"into":[207],"sub":[209],"nodes":[210],"(middle":[211],"mixed":[214],"coarse-middle":[215],"cases)":[217],"enhance":[221],"efficiency.":[224],"contribution":[226],"validated":[228],"experimental":[231],"study":[232],"permitting":[233],"both":[235],"establish":[236],"fine":[237],"interheuristics":[238],"comparisons":[239],"illustrate":[241],"practical":[243],"interest":[244],"designed":[247],"algorithms.":[248]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}