{"id":"https://openalex.org/W2015652866","doi":"https://doi.org/10.1145/2491472.2491474","title":"Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays","display_name":"Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2015652866","doi":"https://doi.org/10.1145/2491472.2491474","mag":"2015652866"},"language":"en","primary_location":{"id":"doi:10.1145/2491472.2491474","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491472.2491474","pdf_url":null,"source":{"id":"https://openalex.org/S158124317","display_name":"ACM Transactions on Storage","issn_l":"1553-3077","issn":["1553-3077","1553-3093"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Storage","raw_type":"journal-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/A5032261147","display_name":"Nihat Altiparmak","orcid":"https://orcid.org/0000-0002-7038-368X"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nihat Altiparmak","raw_affiliation_strings":["University of Texas at San Antonio"],"affiliations":[{"raw_affiliation_string":"University of Texas at San Antonio","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079615374","display_name":"Ali \u015eaman Tosun","orcid":"https://orcid.org/0000-0002-9958-1495"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali \u015eaman Tosun","raw_affiliation_strings":["University of Texas at San Antonio"],"affiliations":[{"raw_affiliation_string":"University of Texas at San Antonio","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032261147"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":null,"apc_paid":null,"fwci":1.2862,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79515711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9965000152587891,"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.8435994386672974},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.6709216833114624},{"id":"https://openalex.org/keywords/data-retrieval","display_name":"Data retrieval","score":0.6536234617233276},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.6295177340507507},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6070759296417236},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47455674409866333},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.47098299860954285},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4382636845111847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41065219044685364},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3580281734466553},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.18595311045646667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1058710515499115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8435994386672974},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.6709216833114624},{"id":"https://openalex.org/C551230270","wikidata":"https://www.wikidata.org/wiki/Q4368942","display_name":"Data retrieval","level":2,"score":0.6536234617233276},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.6295177340507507},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6070759296417236},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47455674409866333},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.47098299860954285},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4382636845111847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41065219044685364},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3580281734466553},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.18595311045646667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1058710515499115},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2491472.2491474","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491472.2491474","pdf_url":null,"source":{"id":"https://openalex.org/S158124317","display_name":"ACM Transactions on Storage","issn_l":"1553-3077","issn":["1553-3077","1553-3093"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Storage","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.936.1467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.936.1467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Nihat_Altiparmak/publication/259873522_Generalized_Optimal_Response_Time_Retrieval_of_Replicated_Data_from_Storage_Arrays/links/0f31752e592e900467000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5419212387","display_name":null,"funder_award_id":"CNS-0855247","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W140616940","https://openalex.org/W187558409","https://openalex.org/W1509747728","https://openalex.org/W1519356465","https://openalex.org/W1544002045","https://openalex.org/W1546065898","https://openalex.org/W1550345201","https://openalex.org/W1554223221","https://openalex.org/W1577760684","https://openalex.org/W1581406059","https://openalex.org/W1588437534","https://openalex.org/W1860420227","https://openalex.org/W1877217803","https://openalex.org/W1885569934","https://openalex.org/W1963094585","https://openalex.org/W1964352192","https://openalex.org/W1968568562","https://openalex.org/W1982391894","https://openalex.org/W1983748443","https://openalex.org/W1988937492","https://openalex.org/W1998700955","https://openalex.org/W2003719432","https://openalex.org/W2012415937","https://openalex.org/W2019114898","https://openalex.org/W2041989747","https://openalex.org/W2052695126","https://openalex.org/W2055175657","https://openalex.org/W2064338074","https://openalex.org/W2069132287","https://openalex.org/W2074429597","https://openalex.org/W2079369525","https://openalex.org/W2090164137","https://openalex.org/W2090359754","https://openalex.org/W2092750459","https://openalex.org/W2094660129","https://openalex.org/W2101939815","https://openalex.org/W2106642566","https://openalex.org/W2117702591","https://openalex.org/W2118269922","https://openalex.org/W2128075647","https://openalex.org/W2131249111","https://openalex.org/W2134454812","https://openalex.org/W2151135734","https://openalex.org/W2151367350","https://openalex.org/W2154264284","https://openalex.org/W2156153879","https://openalex.org/W2162493032","https://openalex.org/W2163750144","https://openalex.org/W2165068957","https://openalex.org/W2294688712","https://openalex.org/W2401610261","https://openalex.org/W2415877944","https://openalex.org/W3149604617","https://openalex.org/W4239864114","https://openalex.org/W4285719527","https://openalex.org/W4301447929"],"related_works":["https://openalex.org/W4205713785","https://openalex.org/W3016766501","https://openalex.org/W2901033488","https://openalex.org/W2067532427","https://openalex.org/W3086458689","https://openalex.org/W1843100083","https://openalex.org/W1510578411","https://openalex.org/W1550753226","https://openalex.org/W2122498864","https://openalex.org/W2004694979"],"abstract_inverted_index":{"Declustering":[0],"techniques":[1,40],"reduce":[2,22],"query":[3,188,190],"response":[4,24,143],"times":[5],"through":[6],"parallel":[7,13],"I/O":[8],"by":[9,135,164],"distributing":[10],"data":[11,30,67],"among":[12],"disks.":[14],"Recently,":[15],"replication-based":[16],"approaches":[17],"were":[18],"proposed":[19,174],"to":[20],"further":[21],"the":[23,61,69,72,77,84,96,115,131,136,141,149,160,167,170,178],"time.":[25],"Efficient":[26],"retrieval":[27,39,63,98,117,132,162,180],"of":[28,65,169,173,177],"replicated":[29,66],"from":[31],"multiple":[32],"disks":[33,70,78],"is":[34,119],"a":[35,101,122,155],"challenging":[36],"problem.":[37,127],"Existing":[38],"are":[41,182],"designed":[42],"for":[43,159],"storage":[44,85],"arrays":[45,86],"with":[46,109],"identical":[47],"disks,":[48],"having":[49],"no":[50],"initial":[51,81,197],"load":[52],"or":[53],"network":[54,194],"delay.":[55],"In":[56],"this":[57,146],"article,":[58],"we":[59],"consider":[60],"generalized":[62,97,116,161],"problem":[64,99,118,163],"where":[68],"in":[71],"system":[73],"might":[74,87],"be":[75,88],"heterogeneous,":[76],"may":[79],"have":[80],"load,":[82],"and":[83,106,145,175,196],"located":[89],"on":[90],"different":[91],"sites.":[92],"We":[93,128,152],"first":[94],"formulate":[95],"using":[100,184],"Linear":[102],"Programming":[103],"(LP)":[104],"model":[105],"solve":[107],"it":[108],"mixed":[110],"integer":[111],"programming":[112],"techniques.":[113],"Next,":[114],"formulated":[120],"as":[121],"more":[123],"efficient":[124],"maximum":[125,137],"flow":[126,138],"prove":[129],"that":[130],"schedule":[133],"returned":[134],"technique":[139],"yields":[140],"optimal":[142],"time":[144],"result":[147],"matches":[148],"LP":[150],"solution.":[151],"also":[153],"propose":[154],"low-complexity":[156],"online":[157],"algorithm":[158],"not":[165],"guaranteeing":[166],"optimality":[168],"result.":[171],"Performance":[172],"state":[176],"art":[179],"strategies":[181],"investigated":[183],"various":[185],"replication":[186],"schemes,":[187],"types,":[189],"loads,":[191],"disk":[192],"specifications,":[193],"delays,":[195],"loads.":[198]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}