{"id":"https://openalex.org/W2582368030","doi":"https://doi.org/10.3390/a10010021","title":"Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files","display_name":"Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files","publication_year":2017,"publication_date":"2017-01-28","ids":{"openalex":"https://openalex.org/W2582368030","doi":"https://doi.org/10.3390/a10010021","mag":"2582368030"},"language":"en","primary_location":{"id":"doi:10.3390/a10010021","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010021","pdf_url":"https://www.mdpi.com/1999-4893/10/1/21/pdf?version=1486204230","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/10/1/21/pdf?version=1486204230","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070478804","display_name":"Sergio De Agostino","orcid":"https://orcid.org/0000-0002-1379-8010"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Sergio Agostino","raw_affiliation_strings":["Computer Science Department, Sapienza University of Rome, Rome 00185, Italy"],"raw_orcid":"https://orcid.org/0000-0002-1379-8010","affiliations":[{"raw_affiliation_string":"Computer Science Department, Sapienza University of Rome, Rome 00185, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078634144","display_name":"Bruno Carpentieri","orcid":"https://orcid.org/0000-0003-1960-9986"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Bruno Carpentieri","raw_affiliation_strings":["Dipartmento di Informatica, Universit\u00e0 di Salerno, Fisciano (SA) 84084, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartmento di Informatica, Universit\u00e0 di Salerno, Fisciano (SA) 84084, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073370244","display_name":"Raffaele Pizzolante","orcid":"https://orcid.org/0000-0001-5722-1179"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Pizzolante","raw_affiliation_strings":["Dipartmento di Informatica, Universit\u00e0 di Salerno, Fisciano (SA) 84084, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartmento di Informatica, Universit\u00e0 di Salerno, Fisciano (SA) 84084, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070478804"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00981197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":"21","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997000098228455,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8798279762268066},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6940805912017822},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.5757254362106323},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5358911752700806},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5326302647590637},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.511457085609436},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5049074292182922},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5023632049560547},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4492664039134979},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.443895161151886},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43708378076553345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34295010566711426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3277367949485779},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16642889380455017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09670794010162354}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8798279762268066},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6940805912017822},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.5757254362106323},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5358911752700806},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5326302647590637},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.511457085609436},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5049074292182922},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5023632049560547},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4492664039134979},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.443895161151886},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43708378076553345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34295010566711426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3277367949485779},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16642889380455017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09670794010162354},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a10010021","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010021","pdf_url":"https://www.mdpi.com/1999-4893/10/1/21/pdf?version=1486204230","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/926513","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/926513","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/926673","is_oa":true,"landing_page_url":"http://hdl.handle.net/11573/926673","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mdpi.com:/1999-4893/10/1/21/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a10010021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 10; Issue 1; Pages: 21","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a10010021","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010021","pdf_url":"https://www.mdpi.com/1999-4893/10/1/21/pdf?version=1486204230","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8600000143051147,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1547966682","https://openalex.org/W1990653637","https://openalex.org/W1995040285","https://openalex.org/W2022126655","https://openalex.org/W2040259652","https://openalex.org/W2051586153","https://openalex.org/W2071779672","https://openalex.org/W2077770566","https://openalex.org/W2094084825","https://openalex.org/W2107745473","https://openalex.org/W2122962290","https://openalex.org/W2502297787","https://openalex.org/W2641828150","https://openalex.org/W4213146104"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W3133183159","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2952222336","https://openalex.org/W3129272755","https://openalex.org/W4297872561","https://openalex.org/W2167946977"],"abstract_inverted_index":{"Broadcasting":[0],"a":[1,9,16,27,54,62,71,88],"message":[2,80],"from":[3],"one":[4],"to":[5,12,122],"many":[6],"processors":[7,86],"in":[8,34,53,57,74,94,104],"network":[10],"corresponds":[11],"concurrent":[13,51,92],"reading":[14,52,69,93],"on":[15,87,111,132],"random":[17],"access":[18],"shared":[19],"memory":[20],"parallel":[21,95],"machine.":[22],"Computing":[23],"the":[24,29,38,58,75,139,154],"trees":[25,113,134],"of":[26,31,61,77,85],"forest,":[28],"level":[30],"each":[32],"node":[33],"its":[35],"tree":[36],"and":[37],"path":[39],"between":[40,82],"two":[41],"nodes":[42],"are":[43,109,151],"problems":[44,66,108],"that":[45],"can":[46],"easily":[47],"be":[48,102],"solved":[49],"with":[50,67,114],"time":[55,72],"logarithmic":[56,73],"maximum":[59],"height":[60],"tree.":[63],"Solving":[64],"such":[65,133],"exclusive":[68],"requires":[70],"number":[76],"nodes,":[78],"implying":[79],"passing":[81],"disjoint":[83],"pairs":[84],"distributed":[89,99],"system.":[90],"Allowing":[91],"algorithm":[96],"design":[97],"for":[98,135],"computing":[100],"might":[101],"advantageous":[103],"practice":[105],"if":[106],"these":[107,130],"faced":[110],"shallow":[112],"some":[115],"specific":[116],"constraints.":[117],"We":[118],"show":[119],"an":[120],"application":[121],"LZC":[123],"(Lempel-Ziv-Compress)-compressed":[124],"file":[125],"decoding,":[126],"whose":[127],"parallelization":[128],"employs":[129],"computations":[131],"realistic":[136],"data.":[137],"On":[138],"other":[140],"hand,":[141],"zipped":[142],"files":[143],"do":[144],"not":[145],"have":[146],"this":[147],"advantage,":[148],"since":[149],"they":[150],"compressed":[152],"by":[153],"Lempel\u2013Ziv":[155],"sliding":[156],"window":[157],"technique.":[158]},"counts_by_year":[],"updated_date":"2026-06-08T08:47:23.578185","created_date":"2017-02-03T00:00:00"}