A bridging model for multi-core computing
TL;DR: It is suggested that the considerable intellectual effort needed for designing efficient algorithms for multi-core architectures may be most fruitfully expended in designing portable algorithms, once and for all, for such a bridging model.
read more
About: This article is published in Journal of Computer and System Sciences. The article was published on 01 Jan 2011. and is currently open access. The article focuses on the topics: Shared memory & Software system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Privacy-preserving access of outsourced data via oblivious RAM simulation
Michael T. Goodrich,Michael Mitzenmacher +1 more
- 04 Jul 2011
TL;DR: This work describes schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithsmic amortized increase in access times, with a very high probability of success, while keeping the external storage to be of size O(n).
326
•Posted Content
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
TL;DR: In this article, the oblivious RAM simulation problem with a small logarithmic or polylogarithm amortized increase in access times was studied, with a very high probability of success, while keeping the external storage to be of size O(n).
194
•Proceedings Article
Asynchronous Large-Scale Graph Processing Made Easy
Guozhang Wang,Wenlei Xie,Alan Demers,Johannes Gehrke +3 more
- 01 Jan 2013
TL;DR: GRACE is designed, a new graph programming platform that separates application logic from execution policies and contains a carefully designed and implemented parallel execution engine for both synchronous and user-specified built-in asynchronous execution policies.
Volta: Performance and Programmability
TL;DR: GV100 is NVIDIAs latest flagship GPU that features enhancements to NVLink, a redesigned streaming microprocessor (SM), and independent thread scheduling enhancements to the single instruction, multiple threads (SIMT) model.
137
References
•Book
Handbook of theoretical computer science
J. Van Leeuwen
- 19 Dec 1990
TL;DR: The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.
4.3K
A bridging model for parallel computation
TL;DR: The bulk-synchronous parallel (BSP) model is introduced as a candidate for this role, and results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
4.1K
The input/output complexity of sorting and related problems
Alok Aggarwal,S. Vitter Jeffrey +1 more
TL;DR: Tight upper and lower bounds are provided for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition.
Amdahl's Law in the Multicore Era
Mark D. Hill,Michael R. Marty +1 more
TL;DR: Augmenting Amdahl's law with a corollary for multicore hardware makes it relevant to future generations of chips with multiple processor cores.
Parallelism in random access machines
Steven Fortune,James C. Wyllie +1 more
- 01 May 1978
TL;DR: A model of computation based on random access machines operating in parallel and sharing a common memory is presented and can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines.