Matches in SemOpenAlex for { <https://semopenalex.org/work/W2227449090> ?p ?o ?g. }
- W2227449090 abstract "In several emerging technologies for computer memory (main memory), the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs poses a fundamentally different model from the RAM for algorithm design. In this paper we study lower and upper bounds for various problems under such asymmetric read and write costs. We consider both the case in which all but $O(1)$ memory has asymmetric cost, and the case of a small cache of symmetric memory. We model both cases using the $(M,omega)$-ARAM, in which there is a small (symmetric) memory of size $M$ and a large unbounded (asymmetric) memory, both random access, and where reading from the large memory has unit cost, but writing has cost $omegagg 1$. For FFT and sorting networks we show a lower bound cost of $Omega(omega nlog_{omega M} n)$, which indicates that it is not possible to achieve asymptotic improvements with cheaper reads when $omega$ is bounded by a polynomial in $M$. Also, there is an asymptotic gap (of $min(omega,log n)/log(omega M)$) between the cost of sorting networks and comparison sorting in the model. This contrasts with the RAM, and most other models. We also show a lower bound for computations on an $ntimes n$ diamond DAG of $Omega(omega n^2/M)$ cost, which indicates no asymptotic improvement is achievable with fast reads. However, we show that for the edit distance problem (and related problems), which would seem to be a diamond DAG, there exists an algorithm with only $O(omega n^2/(Mmin(omega^{1/3},M^{1/2})))$ cost. To achieve this we make use of a path sketch technique that is forbidden in a strict DAG computation. Finally, we show several interesting upper bounds for shortest path problems, minimum spanning trees, and other problems. A common theme in many of the upper bounds is to have redundant computation to tradeoff between reads and writes." @default.
- W2227449090 created "2016-06-24" @default.
- W2227449090 creator A5011772692 @default.
- W2227449090 creator A5014824446 @default.
- W2227449090 creator A5033930662 @default.
- W2227449090 creator A5043897310 @default.
- W2227449090 creator A5051583907 @default.
- W2227449090 date "2015-11-03" @default.
- W2227449090 modified "2023-09-26" @default.
- W2227449090 title "Efficient Algorithms with Asymmetric Read and Write Costs" @default.
- W2227449090 cites W1422898865 @default.
- W2227449090 cites W143350511 @default.
- W2227449090 cites W1496150724 @default.
- W2227449090 cites W1498660721 @default.
- W2227449090 cites W1593955980 @default.
- W2227449090 cites W1655990431 @default.
- W2227449090 cites W1910264759 @default.
- W2227449090 cites W1972501001 @default.
- W2227449090 cites W1988593903 @default.
- W2227449090 cites W2001217269 @default.
- W2227449090 cites W2007572995 @default.
- W2227449090 cites W2011933350 @default.
- W2227449090 cites W2014963708 @default.
- W2227449090 cites W2015477844 @default.
- W2227449090 cites W2034896421 @default.
- W2227449090 cites W2038142281 @default.
- W2227449090 cites W2043266636 @default.
- W2227449090 cites W2047427636 @default.
- W2227449090 cites W2050778306 @default.
- W2227449090 cites W2062934582 @default.
- W2227449090 cites W2065457989 @default.
- W2227449090 cites W2084224084 @default.
- W2227449090 cites W2096800126 @default.
- W2227449090 cites W2097823832 @default.
- W2227449090 cites W2102255233 @default.
- W2227449090 cites W2102449048 @default.
- W2227449090 cites W2117169958 @default.
- W2227449090 cites W2130301020 @default.
- W2227449090 cites W2135393827 @default.
- W2227449090 cites W2141861400 @default.
- W2227449090 cites W2148831941 @default.
- W2227449090 cites W2149906774 @default.
- W2227449090 cites W2162288748 @default.
- W2227449090 cites W2165654401 @default.
- W2227449090 cites W2169528473 @default.
- W2227449090 cites W2171888576 @default.
- W2227449090 cites W2282989799 @default.
- W2227449090 cites W2473485914 @default.
- W2227449090 cites W2949453098 @default.
- W2227449090 doi "https://doi.org/10.48550/arxiv.1511.01038" @default.
- W2227449090 hasPublicationYear "2015" @default.
- W2227449090 type Work @default.
- W2227449090 sameAs 2227449090 @default.
- W2227449090 citedByCount "0" @default.
- W2227449090 crossrefType "posted-content" @default.
- W2227449090 hasAuthorship W2227449090A5011772692 @default.
- W2227449090 hasAuthorship W2227449090A5014824446 @default.
- W2227449090 hasAuthorship W2227449090A5033930662 @default.
- W2227449090 hasAuthorship W2227449090A5043897310 @default.
- W2227449090 hasAuthorship W2227449090A5051583907 @default.
- W2227449090 hasBestOaLocation W22274490901 @default.
- W2227449090 hasConcept C114614502 @default.
- W2227449090 hasConcept C121332964 @default.
- W2227449090 hasConcept C134306372 @default.
- W2227449090 hasConcept C173608175 @default.
- W2227449090 hasConcept C17744445 @default.
- W2227449090 hasConcept C199539241 @default.
- W2227449090 hasConcept C2779557605 @default.
- W2227449090 hasConcept C33923547 @default.
- W2227449090 hasConcept C34388435 @default.
- W2227449090 hasConcept C41008148 @default.
- W2227449090 hasConcept C554936623 @default.
- W2227449090 hasConcept C62520636 @default.
- W2227449090 hasConcept C63553672 @default.
- W2227449090 hasConcept C77553402 @default.
- W2227449090 hasConceptScore W2227449090C114614502 @default.
- W2227449090 hasConceptScore W2227449090C121332964 @default.
- W2227449090 hasConceptScore W2227449090C134306372 @default.
- W2227449090 hasConceptScore W2227449090C173608175 @default.
- W2227449090 hasConceptScore W2227449090C17744445 @default.
- W2227449090 hasConceptScore W2227449090C199539241 @default.
- W2227449090 hasConceptScore W2227449090C2779557605 @default.
- W2227449090 hasConceptScore W2227449090C33923547 @default.
- W2227449090 hasConceptScore W2227449090C34388435 @default.
- W2227449090 hasConceptScore W2227449090C41008148 @default.
- W2227449090 hasConceptScore W2227449090C554936623 @default.
- W2227449090 hasConceptScore W2227449090C62520636 @default.
- W2227449090 hasConceptScore W2227449090C63553672 @default.
- W2227449090 hasConceptScore W2227449090C77553402 @default.
- W2227449090 hasLocation W22274490901 @default.
- W2227449090 hasLocation W22274490902 @default.
- W2227449090 hasOpenAccess W2227449090 @default.
- W2227449090 hasPrimaryLocation W22274490901 @default.
- W2227449090 hasRelatedWork W1833476157 @default.
- W2227449090 hasRelatedWork W1897704527 @default.
- W2227449090 hasRelatedWork W1934065860 @default.
- W2227449090 hasRelatedWork W1985773538 @default.
- W2227449090 hasRelatedWork W2004067661 @default.
- W2227449090 hasRelatedWork W2040339278 @default.
- W2227449090 hasRelatedWork W2045502027 @default.