Matches in SemOpenAlex for { <https://semopenalex.org/work/W2898895592> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W2898895592 startingPage "17" @default.
- W2898895592 abstract "Many fundamental problems in shared-memory distributed computing, including mutual exclusion [James E. Burns and Nancy A. Lynch, 1993], consensus [Leqi Zhu, 2016], and implementations of many sequential objects [Prasad Jayanti et al., 2000], are known to require linear space in the worst case. However, these lower bounds all work by constructing particular executions for any given algorithm that may be both very long and very improbable. The significance of these bounds is justified by an assumption that any space that is used in some execution must be allocated for all executions. This assumption is not consistent with the storage allocation mechanisms of actual practical systems.We consider the consequences of adopting a per-execution approach to space complexity, where an object only counts toward the space complexity of an execution if it is used in that execution. This allows us to show that many known randomized algorithms for fundamental problems in shared-memory distributed computing have expected space complexity much lower than the worst-case lower bounds, and that many algorithms that are adaptive in time complexity can also be made adaptive in space complexity. For the specific problem of mutual exclusion, we develop a new algorithm that illustrates an apparent trade-off between low expected space complexity and low expected RMR complexity. Whether this trade-off is necessary is an open problem.For some applications, it may be helpful to pay only for objects that are updated, as opposed to those that are merely read. We give a data structure that requires no space to represent objects that are not updated at the cost of a small overhead on those that are." @default.
- W2898895592 created "2018-11-09" @default.
- W2898895592 creator A5009422307 @default.
- W2898895592 creator A5036421091 @default.
- W2898895592 creator A5053568123 @default.
- W2898895592 creator A5080591933 @default.
- W2898895592 date "2018-01-01" @default.
- W2898895592 modified "2023-09-26" @default.
- W2898895592 title "Allocate-On-Use Space Complexity of Shared-Memory Algorithms" @default.
- W2898895592 doi "https://doi.org/10.4230/lipics.disc.2018.8" @default.
- W2898895592 hasPublicationYear "2018" @default.
- W2898895592 type Work @default.
- W2898895592 sameAs 2898895592 @default.
- W2898895592 citedByCount "0" @default.
- W2898895592 crossrefType "proceedings-article" @default.
- W2898895592 hasAuthorship W2898895592A5009422307 @default.
- W2898895592 hasAuthorship W2898895592A5036421091 @default.
- W2898895592 hasAuthorship W2898895592A5053568123 @default.
- W2898895592 hasAuthorship W2898895592A5080591933 @default.
- W2898895592 hasConcept C111919701 @default.
- W2898895592 hasConcept C11413529 @default.
- W2898895592 hasConcept C118615104 @default.
- W2898895592 hasConcept C133875982 @default.
- W2898895592 hasConcept C173608175 @default.
- W2898895592 hasConcept C176370821 @default.
- W2898895592 hasConcept C179799912 @default.
- W2898895592 hasConcept C2778572836 @default.
- W2898895592 hasConcept C33923547 @default.
- W2898895592 hasConcept C41008148 @default.
- W2898895592 hasConcept C56348326 @default.
- W2898895592 hasConcept C80444323 @default.
- W2898895592 hasConceptScore W2898895592C111919701 @default.
- W2898895592 hasConceptScore W2898895592C11413529 @default.
- W2898895592 hasConceptScore W2898895592C118615104 @default.
- W2898895592 hasConceptScore W2898895592C133875982 @default.
- W2898895592 hasConceptScore W2898895592C173608175 @default.
- W2898895592 hasConceptScore W2898895592C176370821 @default.
- W2898895592 hasConceptScore W2898895592C179799912 @default.
- W2898895592 hasConceptScore W2898895592C2778572836 @default.
- W2898895592 hasConceptScore W2898895592C33923547 @default.
- W2898895592 hasConceptScore W2898895592C41008148 @default.
- W2898895592 hasConceptScore W2898895592C56348326 @default.
- W2898895592 hasConceptScore W2898895592C80444323 @default.
- W2898895592 hasLocation W28988955921 @default.
- W2898895592 hasOpenAccess W2898895592 @default.
- W2898895592 hasPrimaryLocation W28988955921 @default.
- W2898895592 hasRelatedWork W109674283 @default.
- W2898895592 hasRelatedWork W1518479949 @default.
- W2898895592 hasRelatedWork W1592614963 @default.
- W2898895592 hasRelatedWork W1788381686 @default.
- W2898895592 hasRelatedWork W1826313918 @default.
- W2898895592 hasRelatedWork W2015143242 @default.
- W2898895592 hasRelatedWork W2068035612 @default.
- W2898895592 hasRelatedWork W2111353859 @default.
- W2898895592 hasRelatedWork W2116511608 @default.
- W2898895592 hasRelatedWork W2150280772 @default.
- W2898895592 hasRelatedWork W2220305212 @default.
- W2898895592 hasRelatedWork W2287095650 @default.
- W2898895592 hasRelatedWork W2407573515 @default.
- W2898895592 hasRelatedWork W2611376629 @default.
- W2898895592 hasRelatedWork W2950123107 @default.
- W2898895592 hasRelatedWork W2953161186 @default.
- W2898895592 hasRelatedWork W3128202477 @default.
- W2898895592 hasRelatedWork W3156095527 @default.
- W2898895592 hasRelatedWork W3204042549 @default.
- W2898895592 hasRelatedWork W98899188 @default.
- W2898895592 isParatext "false" @default.
- W2898895592 isRetracted "false" @default.
- W2898895592 magId "2898895592" @default.
- W2898895592 workType "article" @default.