{"id":"https://openalex.org/W2169002876","doi":"https://doi.org/10.1145/1708046.1708055","title":"Compress-and-conquer for optimal multicore computing","display_name":"Compress-and-conquer for optimal multicore computing","publication_year":2010,"publication_date":"2010-01-19","ids":{"openalex":"https://openalex.org/W2169002876","doi":"https://doi.org/10.1145/1708046.1708055","mag":"2169002876"},"language":"en","primary_location":{"id":"doi:10.1145/1708046.1708055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1708046.1708055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming","raw_type":"proceedings-article"},"type":"conference-paper","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/A5109833788","display_name":"Zhijing G. Mou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhijing G. Mou","raw_affiliation_strings":["Sinovate, LLC, Seatle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sinovate, LLC, Seatle, WA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100368947","display_name":"Hai Liu","orcid":"https://orcid.org/0000-0003-1365-2940"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hai Liu","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113456823","display_name":"Paul Hudak","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Hudak","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2028258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"44"},"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.9998000264167786,"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.9998000264167786,"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.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/haskell","display_name":"Haskell","score":0.7749388217926025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7528011798858643},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7033624649047852},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.6775671243667603},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5746721625328064},{"id":"https://openalex.org/keywords/tridiagonal-matrix","display_name":"Tridiagonal matrix","score":0.5647751092910767},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5570462942123413},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42302340269088745},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.41673198342323303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36311060190200806},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.3604743480682373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3333245515823364}],"concepts":[{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.7749388217926025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7528011798858643},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7033624649047852},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.6775671243667603},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5746721625328064},{"id":"https://openalex.org/C51647924","wikidata":"https://www.wikidata.org/wiki/Q1755277","display_name":"Tridiagonal matrix","level":3,"score":0.5647751092910767},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5570462942123413},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42302340269088745},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.41673198342323303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36311060190200806},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3604743480682373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3333245515823364},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":3,"locations":[{"id":"doi:10.1145/1708046.1708055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1708046.1708055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.311","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/homes/hl293/download/damp05g-mou.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.983.8705","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.983.8705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://haskell.cs.yale.edu/wp-content/uploads/2011/02/DAMPFinalPaper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W57462620","https://openalex.org/W114614391","https://openalex.org/W1489689515","https://openalex.org/W1556536463","https://openalex.org/W1605715232","https://openalex.org/W1972872690","https://openalex.org/W1979566015","https://openalex.org/W2076617743","https://openalex.org/W2143462372","https://openalex.org/W2150848984","https://openalex.org/W2150871235","https://openalex.org/W2163496769","https://openalex.org/W2172307690","https://openalex.org/W2173213060","https://openalex.org/W2186799393","https://openalex.org/W2436525433","https://openalex.org/W6636101664"],"related_works":["https://openalex.org/W2139655214","https://openalex.org/W2112263414","https://openalex.org/W2038430052","https://openalex.org/W2071826812","https://openalex.org/W3004782279","https://openalex.org/W1602185604","https://openalex.org/W2028779182","https://openalex.org/W2132718937","https://openalex.org/W2072396164","https://openalex.org/W2214925497"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,17,24,58,118,138,205,230],"programming":[3,110],"paradigm":[4,104,136,198],"called":[5],"compress-and-conquer":[6],"(CC)":[7],"that":[8,184,189,227],"leads":[9],"to":[10,34,54,77,87,120,137,176],"optimal":[11],"performance":[12,156,234],"on":[13,229],"multicore":[14,18,109,231],"platforms.":[15],"Given":[16],"system":[19],"of":[20,26,39,45,61,65,95,108,125,140,157,171,190],"p":[21,35,56],"cores":[22],"and":[23,70,151,162,165,181,194,233],"problem":[25,30,64,80,90,119,173],"size":[27,66],"n,":[28],"the":[29,46,52,55,62,78,85,88,93,96,106,113,126,134,172,237],"is":[31,68,81,160,221],"first":[32],"reduced":[33],"smaller":[36,97],"problems,":[37,57],"each":[38,124],"which":[40],"can":[41,212],"be":[42,121,213],"solved":[43,71],"independently":[44],"others":[47],"(the":[48,72,99],"compression":[49],"phase).":[50,74,101],"From":[51],"solutions":[53,94],"compressed":[59,89],"version":[60],"same":[63],"O(p)":[67],"deduced":[69],"global":[73],"The":[75,102,155,196],"solution":[76,86],"original":[79],"then":[82],"derived":[83],"from":[84],"together":[91],"with":[92],"problems":[98,141],"expansion":[100],"CC":[103,135,158,177,197],"reduces":[105],"complexity":[107],"by":[111,215],"allowing":[112],"best-known":[114],"sequential":[115],"algorithm":[116],"for":[117],"used":[122],"in":[123,202],"three":[127],"phases.":[128],"In":[129],"this":[130],"paper":[131],"we":[132,182],"apply":[133],"range":[139],"including":[142],"scan,":[143,145,191,193],"nested":[144,192],"difference":[146],"equations,":[147],"banded":[148],"linear":[149,152,166],"systems,":[150],"tridiagonal":[153],"systems.":[154],"programs":[159],"analyzed,":[161],"their":[163],"optimality":[164],"speedup":[167],"are":[168,178],"proven.":[169],"Characteristics":[170],"space":[174],"subject":[175],"formally":[179],"examined,":[180],"show":[183],"its":[185],"computational":[186],"power":[187],"subsumes":[188],"mapReduce.":[195],"has":[199],"been":[200],"implemented":[201],"Haskell":[203,225],"as":[204],"modular,":[206],"higher-order":[207],"function,":[208],"whose":[209],"constituent":[210],"functions":[211],"shared":[214],"seemingly":[216],"unrelated":[217],"problems.":[218],"This":[219],"function":[220],"compiled":[222],"into":[223],"low-level":[224],"threads":[226],"run":[228],"machine,":[232],"benchmarks":[235],"confirm":[236],"theoretical":[238],"analysis.":[239],"D.1.3":[240],"[Parallel":[241],"Program-":[242]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}