On the public citation graph

Algorithms for parallel memory, II: Hierarchical multilevel memories

0 signed · 114 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1993.1008openalex-snapshot
Large-Scale Sorting in Uniform Memory Hierarchies
inferredcites →https://doi.org/10.1007/bf01185206openalex-snapshot
The uniform memory hierarchy model of computation
inferredcites →https://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferredcites →https://doi.org/10.1109/sfcs.1987.31openalex-snapshot
Hierarchical memory with block transfer
inferredcites →https://doi.org/10.1145/113379.113382openalex-snapshot
Large-scale sorting in parallel memories (extended abstract)
inferredcites →https://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferredcites →https://doi.org/10.1145/28395.28428openalex-snapshot
A model for hierarchical memory
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/7531.7532openalex-snapshot
A logarithmic time sort for linear size networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.1898openalex-snapshot
Resource analyses for parallel and distributed coordination
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1008openalex-snapshot
Large-Scale Sorting in Uniform Memory Hierarchies
inferred← citeshttps://doi.org/10.1007/11561071_57openalex-snapshot
Stxxl: Standard Template Library for XXL Data Sets
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_1openalex-snapshot
Algorithm Engineering for Parallel Computation
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_73openalex-snapshot
Seamless Integration of Parallelism and Memory Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_65openalex-snapshot
Architecture Independent Analysis of Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_5openalex-snapshot
An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_1openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_178openalex-snapshot
High Performance Algorithm Engineering for Large-scale Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_1openalex-snapshot
I/O in Parallel and Distributed Systems: An Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_2openalex-snapshot
An Introduction to Parallel I/O Models and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_3openalex-snapshot
Issues in Compiling I/O Intensive Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_10openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_178openalex-snapshot
High Performance Algorithm Engineering for Large-Scale Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-67063-4_7openalex-snapshot
The Interleaved Memory Efficiency for Multithread Memory Calls Processing
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_28openalex-snapshot
A Data Cache with Dynamic Mapping
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_125openalex-snapshot
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_2openalex-snapshot
A Bridging Model for Multi-core Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_1openalex-snapshot
Study on Parallel Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-02538-9_6openalex-snapshot
Algorithm Engineering: Concepts and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-20674-0_2openalex-snapshot
External Memory Breadth-First Search with Delayed Duplicate Detection on the GPU
inferred← citeshttps://doi.org/10.1007/bf01185206openalex-snapshot
The uniform memory hierarchy model of computation
inferred← citeshttps://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferred← citeshttps://doi.org/10.1007/s00224-001-0002-1openalex-snapshot
Blocking in Parallel Multisearch Problems
inferred← citeshttps://doi.org/10.1007/s00224-002-1066-2openalex-snapshot
Bulk Synchronous Parallel Algorithms for the External Memory Model
inferred← citeshttps://doi.org/10.1007/s00453-007-9131-5openalex-snapshot
I/O-Efficient Algorithms for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-010-9394-0openalex-snapshot
The Cost of Cache-Oblivious Searching
inferred← citeshttps://doi.org/10.1007/s11390-006-0665-9openalex-snapshot
Study on Parallel Computing
inferred← citeshttps://doi.org/10.1007/s11704-007-0016-1openalex-snapshot
Models of parallel computation: a survey and classification
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.01.004openalex-snapshot
On the importance of cache tuning in a cache-aware algorithm: A case study
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.014openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.012openalex-snapshot
A bridging model for multi-core computing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.008openalex-snapshot
Translating submachine locality into locality of reference
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.06.004openalex-snapshot
Conflict-free star-access in parallel memory systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00063-5openalex-snapshot
The economics of large-memory computations
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00217-2openalex-snapshot
An external memory data structure for shortest path queries
inferred← citeshttps://doi.org/10.1016/s0167-739x(01)00056-5openalex-snapshot
On a scheme for parallel sorting on heterogeneous clusters
inferred← citeshttps://doi.org/10.1016/s0927-5452(98)80011-7openalex-snapshot
Parallel Probabilistic Computations on a Cluster of Workstations
inferred← citeshttps://doi.org/10.1080/10637199608915543openalex-snapshot
MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗
inferred← citeshttps://doi.org/10.1090/dimacs/050openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1090/dimacs/050/09openalex-snapshot
A survey of out-of-core algorithms in numerical linear algebra
inferred← citeshttps://doi.org/10.1109/cse.2010.40openalex-snapshot
LogGPH: A Parallel Computational Model with Hierarchical Communication Awareness
inferred← citeshttps://doi.org/10.1109/hicss.1995.375477openalex-snapshot
Models and resource metrics for parallel and distributed computation
inferred← citeshttps://doi.org/10.1109/hpcc.2010.22openalex-snapshot
K-Model: A New Computational Model for Stream Processors
inferred← citeshttps://doi.org/10.1109/icapp.1997.651524openalex-snapshot
The economics of large-memory computations
inferred← citeshttps://doi.org/10.1109/icde.1996.492115openalex-snapshot
Parallel pointer-based join algorithms in memory mapped environments
inferred← citeshttps://doi.org/10.1109/icde.2010.5447865openalex-snapshot
Scalable distributed-memory external sorting
inferred← citeshttps://doi.org/10.1109/icppw.2016.29openalex-snapshot
Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015576openalex-snapshot
An out-of-core sorting algorithm for clusters with processors at different speed
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213491openalex-snapshot
Accessing hardware performance counters in order to measure the influence of cache on the performance of integer sorting
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302947openalex-snapshot
Translating submachine locality into locality of reference (extended abstract)
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161001openalex-snapshot
Building a parallel pipelined external memory algorithm library
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470354openalex-snapshot
Oblivious algorithms for multicores and network of processors
inferred← citeshttps://doi.org/10.1109/ipps.1999.760428openalex-snapshot
Reducing I/O complexity by simulating coarse grained parallel algorithms
inferred← citeshttps://doi.org/10.1109/sc.2004.40openalex-snapshot
Predicting and Evaluating Distributed Communication Performance
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892128openalex-snapshot
Cache-oblivious B-trees
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238201openalex-snapshot
The cost of cache-oblivious searching
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814600openalex-snapshot
Cache-oblivious algorithms
inferred← citeshttps://doi.org/10.1109/tc.2007.38openalex-snapshot
$\log_{\rm n}{\rm P}$ and $\log_{3}{\rm P}$: Accurate Analytical Models of Point-to-Point Communication in Distributed Systems
inferred← citeshttps://doi.org/10.1109/tpds.2007.1024openalex-snapshot
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
inferred← citeshttps://doi.org/10.1137/070711761openalex-snapshot
Faster Integer Multiplication
inferred← citeshttps://doi.org/10.1137/1.9781611973402.115openalex-snapshot
Bicriteria data compression
inferred← citeshttps://doi.org/10.1137/17m1121457openalex-snapshot
Bicriteria Data Compression
inferred← citeshttps://doi.org/10.1137/s0097539701389956openalex-snapshot
Cache-Oblivious B-Trees
inferred← citeshttps://doi.org/10.1142/9789812773289_0005openalex-snapshot
I/O-Optimal Algorithms for Outerplanar Graphs
inferred← citeshttps://doi.org/10.1145/1142473.1142511openalex-snapshot
GPUTeraSort
inferred← citeshttps://doi.org/10.1145/1189740.1189744openalex-snapshot
The Web as a graph
inferred← citeshttps://doi.org/10.1145/1250790.1250800openalex-snapshot
Faster integer multiplication
inferred← citeshttps://doi.org/10.1145/1463768.1463780openalex-snapshot
A unified model for multicore architectures
inferred← citeshttps://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1145/1963190.2019580openalex-snapshot
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
inferred← citeshttps://doi.org/10.1145/2071379.2071383openalex-snapshot
Cache-Oblivious Algorithms
inferred← citeshttps://doi.org/10.1145/237502.237547openalex-snapshot
μDatabase
inferred← citeshttps://doi.org/10.1145/242223.242300openalex-snapshot
Strategic directions in storage I/O issues in large-scale computing
inferred← citeshttps://doi.org/10.1145/242224.242490openalex-snapshot
A bridging model for parallel computation, communication, and I/O
inferred← citeshttps://doi.org/10.1145/2422436.2422470openalex-snapshot
An energy complexity model for algorithms
inferred← citeshttps://doi.org/10.1145/275487.275501openalex-snapshot
External memory algorithms
inferred← citeshttps://doi.org/10.1145/2989081.2989097openalex-snapshot
Challenges of Programming a System with Heterogeneous Memories and Heterogeneous Processors
inferred← citeshttps://doi.org/10.1145/301618.301661openalex-snapshot
A fast Fourier transform compiler
inferred← citeshttps://doi.org/10.1145/301631.301661openalex-snapshot
A fast Fourier transform compiler
inferred← citeshttps://doi.org/10.1145/3470635openalex-snapshot
External-memory Dictionaries in the Affine and PDAM Models
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/509907.509950openalex-snapshot
Cache-oblivious priority queue and graph algorithm applications
inferred← citeshttps://doi.org/10.1155/2009/681708openalex-snapshot
Evaluating Multicore Algorithms on the Unified Memory Model
inferred← citeshttps://doi.org/10.1349/ddlp.1676openalex-snapshot
Efficient I/O for computational grid applications.
inferred← citeshttps://doi.org/10.14529/cmse190304openalex-snapshot
Survey of Parallel Computation Models
inferred← citeshttps://doi.org/10.1504/ijhpcn.2005.008035openalex-snapshot
Parallel out-of-core sorting and fast accesses to disks
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.2172/468615openalex-snapshot
Massively parallel I/O: Building an infrastructure for parallel computing
inferred← citeshttps://doi.org/10.22028/d291-25687openalex-snapshot
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice
inferred← citeshttps://doi.org/10.22215/etd/2007-07899openalex-snapshot
A parallel external memory system
inferred← citeshttps://doi.org/10.22215/etd/2010-08701openalex-snapshot
Practical parallel external memory algorithms via simulation of parallel algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.0811.2535openalex-snapshot
A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4071openalex-snapshot
Efficient Resource Oblivious Algorithms for Multicores
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612105openalex-snapshot
Towards Parallel Computing on the Internet: Applications, Architectures, Models and Programming Tools
inferred← citeshttps://doi.org/10.5445/ir/1000048581openalex-snapshot
External Batched Range Minimum Queries and LCP Construction
inferred← citeshttps://doi.org/10.5555/365411.365423openalex-snapshot
I/O-efficient algorithms for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.5555/545381.545385openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.5555/644108.644203openalex-snapshot
The set-associative cache performance of search trees
inferred← citeshttps://doi.org/10.7155/jgaa.00082openalex-snapshot
I/O-Optimal Algorithms for Outerplanar Graphs
inferred← citeshttps://doi.org/10.7936/k73x84sgopenalex-snapshot
Modeling Algorithm Performance on Highly-threaded Many-core Architectures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.