{"id":"https://openalex.org/W2591743193","doi":"https://doi.org/10.13016/m2tg0x","title":"Easy PRAM-based High-performance parallel Programming","display_name":"Easy PRAM-based High-performance parallel Programming","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2591743193","doi":"https://doi.org/10.13016/m2tg0x","mag":"2591743193"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/19069","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M2TG0X","pdf_url":"http://hdl.handle.net/1903/19069","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1903/19069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052995266","display_name":"Fady Ghanim","orcid":"https://orcid.org/0000-0002-0726-6747"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ghanim, Fady","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5052995266"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9979000091552734,"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.9979000091552734,"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.9861000180244446,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6439439654350281},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6294116377830505},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33732420206069946}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6439439654350281},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6294116377830505},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33732420206069946}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/19069","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M2TG0X","pdf_url":"http://hdl.handle.net/1903/19069","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:2591743193","is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/handle/1903/19069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.13016/m2tg0x","is_oa":true,"landing_page_url":"https://doi.org/10.13016/m2tg0x","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Collection"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/19069","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M2TG0X","pdf_url":"http://hdl.handle.net/1903/19069","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2591743193.pdf","grobid_xml":"https://content.openalex.org/works/W2591743193.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1534691237","https://openalex.org/W2291577565","https://openalex.org/W1480177078","https://openalex.org/W2168103476","https://openalex.org/W2171581640","https://openalex.org/W2063641859","https://openalex.org/W1568054458","https://openalex.org/W1984781254","https://openalex.org/W3148887865","https://openalex.org/W2043868451","https://openalex.org/W2370829061","https://openalex.org/W2116172613","https://openalex.org/W2020537133","https://openalex.org/W612802984","https://openalex.org/W2151935633","https://openalex.org/W2056702832","https://openalex.org/W2086779654","https://openalex.org/W2085780778","https://openalex.org/W186213323","https://openalex.org/W2128031806"],"abstract_inverted_index":{"Parallel":[0],"machines":[1],"have":[2,11],"become":[3],"more":[4],"widely":[5],"used.":[6],"Unfortunately":[7],"parallel":[8,56,93,182],"programming":[9,57,129,183],"technologies":[10],"advanced":[12],"at":[13,140],"a":[14,54,66,72,103,174,195,246],"much":[15],"slower":[16],"pace":[17],"except":[18],"for":[19,71,250],"regular":[20],"programs.":[21,135,148],"For":[22,208],"irregular":[23,134,147],"programs,":[24,210],"this":[25,169],"advancement":[26],"is":[27,44,60,65,170,173],"inhibited":[28],"by":[29,177],"high":[30],"synchronization":[31],"costs,":[32],"non-loop":[33],"parallelism,":[34],"non-array":[35],"data":[36],"structures,":[37],"recursively":[38],"expressed":[39],"parallelism":[40,42,145],"and":[41,83,95,117,130],"that":[43,59,100,120,171],"too":[45],"fine-grained":[46,144],"to":[47,79,224,243],"be":[48,102],"exploitable.":[49],"This":[50,97,149],"work":[51,98,150],"introduced":[52],"ICE,":[53],"new":[55],"language":[58,160],"easy-to-program,":[61],"since:":[62],"(i)":[63],"ICE":[64,76,101,118,154,159,238,251],"synchronous,":[67],"lock-step":[68],"language;":[69,165],"(ii)":[70],"PRAM":[73,86,114],"algorithm":[74],"its":[75],"program":[77],"amounts":[78],"directly":[80],"transcribing":[81],"it;":[82],"(iii)":[84],"the":[85,110,113,124,153,158,162,166,211,233],"algorithmic":[87,115],"theory":[88],"offers":[89],"unique":[90],"wealth":[91],"of":[92,105,109,127,133,168,188,190,203,216,218],"algorithms":[94],"techniques.":[96],"suggests":[99],"part":[104],"an":[106],"ecosystem":[107],"consisting":[108],"XMT":[111,137],"architecture,":[112,138],"model,":[116],"itself,":[119],"together":[121],"deliver":[122],"on":[123],"twin":[125],"goal":[126],"easy":[128],"efficient":[131],"parallelization":[132],"The":[136,228,237],"developed":[139],"UMD,":[141],"can":[142],"exploit":[143],"in":[146,197,200,214],"also":[151],"presents":[152],"compiler":[155,239],"which":[156],"translates":[157],"into":[161],"multithreaded":[163],"XMTC":[164,227,244],"significance":[167],"multi-threading":[172],"feature":[175],"shared":[176],"practically":[178],"all":[179,253],"current":[180],"scalable":[181],"languages.":[184],"As":[185],"one":[186],"indication":[187],"ease":[189],"programming,":[191],"it":[192],"was":[193,220],"observed":[194],"reduction":[196,213],"code":[198,219,235],"size":[199],"11":[201],"out":[202],"16":[204],"benchmarks":[205,231],"vs.":[206],"XMTC.":[207],"these":[209],"average":[212,248],"number":[215],"lines":[217],"35.53%":[221],"when":[222],"compared":[223],"hand":[225],"optimized":[226],"remaining":[229],"4":[230],"had":[232],"same":[234],"size.":[236],"achieved":[240],"comparable":[241],"run-time":[242],"with":[245],"0.48%":[247],"gain":[249],"across":[252],"benchmarks.":[254]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
