A model of sequential computation with Pipelined access to memory

DOI10.1007/BF01189854MaRDI QIDQ3142000zbMATH OpenFDO

Authors Fabrizio Luccio, L. Pagli

Publication date 19 May 1994

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01189854

zbMATH Keywords

complexity classesparallel computationLogarithmic Pipelined Modelmodel of sequential computationpipelined accesses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Computing with pipelined block transfer
• scientific article; zbMATH DE number 177541
• A new model for large memories
• A Model for Asynchronous Shared Memory Parallel Computation
• Exploiting locality in LT-RAM computations

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A parallel algorithm for constructing minimum spanning trees
• A taxonomy of problems with fast parallel algorithms
• Searching, Merging, and Sorting in Parallel Computation

Cited in

(6)

• Exploiting locality in LT-RAM computations
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Bicriteria data compression
• Computing with pipelined block transfer
• Modeling of priorityless processing in an interleaved memory with a perfectly informed processor
• A new model for large memories

This page was built for publication: A model of sequential computation with Pipelined access to memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142000)