Matches in SemOpenAlex for { <https://semopenalex.org/work/W2738668855> ?p ?o ?g. }
Showing items 1 to 47 of
47
with 100 items per page.
- W2738668855 abstract "It's important to hit a space-time balance for a real-world algorithm to achieve high performance on modern shared-memory multi-core and many-core systems. However, a large class of programs with more than O(1) dependency achieved optimality either in space or time, but not both. In the literature, the problem is known as the fundamental space-time tradeoff. We propose the notion of Processor-Adaptiveness. In contrast to the prior Processor-Awareness, our approach does not partition statically the problem space to the processor grid, but uses the processor count P to just upper bound the space and cache requirement in a cache-oblivious fashion. In the meantime, our processor-adaptive algorithms enjoy the full benefits of dynamic load-balance, which is a key to achieving satisfactory speedup on a shared-memory system, especially when the problem dimension n is reasonably larger than P. By utilizing the busy-leaves property of runtime scheduler and a program managed memory pool that combines the advantages of stack and heap, we show that our STAR (Space-Time Adaptive and Reductive) technique can help these programs to achieve sublinear time bounds while keeping to be asymptotically work-, space-, and cache-optimal. The key achievement of this paper is to obtain the first sublinear O(n3/4 log n) time and optimal O(n3) work GAP algorithm; If we further bound the space and cache requirement of the algorithm to be asymptotically optimal, there will be a factor of P increase in time bound without sacrificing the work bound. If P = o(n1/4 / log n), the time bound stays sublinear and may be a better tradeoff between time and space requirements in practice." @default.
- W2738668855 created "2017-07-31" @default.
- W2738668855 creator A5018607197 @default.
- W2738668855 creator A5081522067 @default.
- W2738668855 date "2017-07-24" @default.
- W2738668855 modified "2023-09-24" @default.
- W2738668855 title "Brief Announcement" @default.
- W2738668855 cites W1997882689 @default.
- W2738668855 cites W2020777648 @default.
- W2738668855 cites W2028087580 @default.
- W2738668855 cites W2032839380 @default.
- W2738668855 cites W2043275593 @default.
- W2738668855 cites W2052196304 @default.
- W2738668855 cites W2059310886 @default.
- W2738668855 cites W2087817903 @default.
- W2738668855 cites W2145889866 @default.
- W2738668855 cites W2152971387 @default.
- W2738668855 cites W2276454361 @default.
- W2738668855 cites W2711285122 @default.
- W2738668855 doi "https://doi.org/10.1145/3087556.3087593" @default.
- W2738668855 hasPublicationYear "2017" @default.
- W2738668855 type Work @default.
- W2738668855 sameAs 2738668855 @default.
- W2738668855 citedByCount "1" @default.
- W2738668855 countsByYear W27386688552018 @default.
- W2738668855 crossrefType "proceedings-article" @default.
- W2738668855 hasAuthorship W2738668855A5018607197 @default.
- W2738668855 hasAuthorship W2738668855A5081522067 @default.
- W2738668855 hasConcept C41008148 @default.
- W2738668855 hasConceptScore W2738668855C41008148 @default.
- W2738668855 hasLocation W27386688551 @default.
- W2738668855 hasOpenAccess W2738668855 @default.
- W2738668855 hasPrimaryLocation W27386688551 @default.
- W2738668855 hasRelatedWork W2093578348 @default.
- W2738668855 hasRelatedWork W2130043461 @default.
- W2738668855 hasRelatedWork W2350741829 @default.
- W2738668855 hasRelatedWork W2358668433 @default.
- W2738668855 hasRelatedWork W2376932109 @default.
- W2738668855 hasRelatedWork W2382290278 @default.
- W2738668855 hasRelatedWork W2390279801 @default.
- W2738668855 hasRelatedWork W2748952813 @default.
- W2738668855 hasRelatedWork W2899084033 @default.
- W2738668855 hasRelatedWork W3004735627 @default.
- W2738668855 isParatext "false" @default.
- W2738668855 isRetracted "false" @default.
- W2738668855 magId "2738668855" @default.
- W2738668855 workType "article" @default.