A model of sequential computation with Pipelined access to memory

DOI10.1007/BF01189854zbMATH Open0787.68038MaRDI QIDQ3142000FDOQ3142000

Fabrizio Luccio, L. Pagli

Publication date: 19 May 1994

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

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)

Cites Work

• Title not available (Why is that?)
• A taxonomy of problems with fast parallel algorithms
• A parallel algorithm for constructing minimum spanning trees
• Searching, Merging, and Sorting in Parallel Computation

Cited In (6)

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

   Recommendations

• Computing with pipelined block transfer 👍 👎
• Title not available (Why is that?) 👍 👎
• A new model for large memories 👍 👎
• A Model for Asynchronous Shared Memory Parallel Computation 👍 👎
• Exploiting locality in LT-RAM computations 👍 👎

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)