{"id":"https://openalex.org/W2111638508","doi":"https://doi.org/10.1145/2184512.2184575","title":"Comparing parallel performance of Go and C++ TBB on a direct acyclic task graph using a dynamic programming problem","display_name":"Comparing parallel performance of Go and C++ TBB on a direct acyclic task graph using a dynamic programming problem","publication_year":2012,"publication_date":"2012-03-29","ids":{"openalex":"https://openalex.org/W2111638508","doi":"https://doi.org/10.1145/2184512.2184575","mag":"2111638508"},"language":"en","primary_location":{"id":"doi:10.1145/2184512.2184575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2184512.2184575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual Southeast Regional Conference","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/A5074108287","display_name":"Doug Serfass","orcid":null},"institutions":[{"id":"https://openalex.org/I102401767","display_name":"University of Arkansas at Little Rock","ror":"https://ror.org/04fttyv97","country_code":"US","type":"education","lineage":["https://openalex.org/I102401767"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Doug Serfass","raw_affiliation_strings":["University of Arkansas at Little Rock, Little Rock, Arkansas","University of Arkansas at Little Rock , Little Rock, Arkansas"],"affiliations":[{"raw_affiliation_string":"University of Arkansas at Little Rock, Little Rock, Arkansas","institution_ids":["https://openalex.org/I102401767"]},{"raw_affiliation_string":"University of Arkansas at Little Rock , Little Rock, Arkansas","institution_ids":["https://openalex.org/I102401767"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013607020","display_name":"Peiyi Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I102401767","display_name":"University of Arkansas at Little Rock","ror":"https://ror.org/04fttyv97","country_code":"US","type":"education","lineage":["https://openalex.org/I102401767"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peiyi Tang","raw_affiliation_strings":["University of Arkansas at Little Rock, Little Rock, Arkansas","University of Arkansas at Little Rock , Little Rock, Arkansas"],"affiliations":[{"raw_affiliation_string":"University of Arkansas at Little Rock, Little Rock, Arkansas","institution_ids":["https://openalex.org/I102401767"]},{"raw_affiliation_string":"University of Arkansas at Little Rock , Little Rock, Arkansas","institution_ids":["https://openalex.org/I102401767"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074108287"],"corresponding_institution_ids":["https://openalex.org/I102401767"],"apc_list":null,"apc_paid":null,"fwci":0.5801,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68540378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9937999844551086,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8176000714302063},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8081121444702148},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7768003940582275},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5111613869667053},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4961436688899994},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.42794832587242126},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.42155972123146057},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3790970742702484},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.25402653217315674},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23260009288787842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1194705069065094},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.11399856209754944}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8176000714302063},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8081121444702148},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7768003940582275},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5111613869667053},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4961436688899994},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.42794832587242126},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.42155972123146057},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3790970742702484},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25402653217315674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23260009288787842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1194705069065094},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.11399856209754944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2184512.2184575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2184512.2184575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual Southeast Regional Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1272390144","display_name":null,"funder_award_id":"CRI CNS-0855248EPS-0701890EPS-0918970MRI CNS-0619069OISE-0729792","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2905114823","display_name":null,"funder_award_id":"CRI CNS-0855248EPS-0701890EPS-0918970MRI CNS-0619069OISE-0729792","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"},{"id":"https://openalex.org/G503844299","display_name":null,"funder_award_id":"CRI CNS-0855248EPS-0701890EPS-0918970MRI CNS-0619069OISE-0729792","funder_id":"https://openalex.org/F4320338283","funder_display_name":"Office of Experimental Program to Stimulate Competitive Research"},{"id":"https://openalex.org/G7759863005","display_name":null,"funder_award_id":"CRI CNS-0855248EPS-0701890EPS-0918970MRI CNS-0619069OISE-0729792","funder_id":"https://openalex.org/F4320337370","funder_display_name":"Office of International Science and Engineering"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337370","display_name":"Office of International Science and Engineering","ror":"https://ror.org/01k638r21"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"},{"id":"https://openalex.org/F4320338283","display_name":"Office of Experimental Program to Stimulate Competitive Research","ror":"https://ror.org/04k9mqs78"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1532296632","https://openalex.org/W1536852470","https://openalex.org/W1981109753","https://openalex.org/W2011875368","https://openalex.org/W2107705503","https://openalex.org/W2144714514","https://openalex.org/W3022841918","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2149404148","https://openalex.org/W2154394052"],"abstract_inverted_index":{"Concurrent":[0],"programming":[1,14,73],"languages":[2,117],"Go":[3,21,46,76,102,144,200],"and":[4,23,47,52,77,85,87,103,106,136,145,180,187,195,201],"C++":[5],"Threading":[6],"Building":[7],"Blocks":[8],"(TBB)":[9],"offer":[10],"high":[11],"level":[12],"parallel":[13,64],"mechanisms":[15,44,60],"built":[16],"on":[17,39],"top":[18,204],"of":[19,66,112,133,150,174,184,206,212],"threads.":[20],"goroutines":[22],"TBB":[24,48,104,139,151,160,192,207],"task":[25,54,92,124,134,185,193],"classes":[26],"are":[27,34,49,118],"used":[28],"as":[29],"the":[30,50,53,67,82,131,147,172,175,181,203],"computation":[31],"units":[32],"that":[33,130,146,191,202,211],"mapped":[35],"to":[36,61,108,154,171],"physical":[37],"threads":[38],"multi-core":[40],"processors.":[41],"The":[42],"synchronization":[43,137,196],"in":[45,75,138],"channel":[51],"scheduler,":[55],"respectively.":[56],"We":[57,100,189],"utilized":[58],"these":[59,115],"implement":[62],"a":[63,89,110,121],"version":[65],"optimal":[68,95],"binary":[69],"search":[70],"tree":[71],"dynamic":[72],"algorithm":[74],"TBB.":[78],"Both":[79],"implementations":[80],"tile":[81],"iteration":[83],"space":[84],"construct":[86],"evaluate":[88],"direct":[90,122],"acyclic":[91,123],"graph":[93],"for":[94],"parallelism":[96],"without":[97],"over":[98],"constraints.":[99],"compared":[101],"speedup":[105,164,205],"performance":[107,149],"create":[109],"benchmark":[111],"how":[113],"efficient":[114],"two":[116],"at":[119],"evaluating":[120],"graph.":[125],"Our":[126],"experimental":[127],"results":[128],"show":[129],"overhead":[132],"scheduling":[135,186,194],"is":[140,152,197,208],"much":[141],"smaller":[142],"than":[143,158,199,210],"overall":[148],"1.6":[153],"3.6":[155],"times":[156],"faster":[157,198],"Go.":[159,213],"provided":[161],"super":[162],"linear":[163],"under":[165],"certain":[166],"conditions,":[167],"which":[168],"we":[169],"attribute":[170],"majority":[173],"test":[176],"data":[177],"being":[178],"cached":[179],"negative":[182],"cost":[183],"synchronization.":[188],"conclude":[190],"greater":[209]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}