Computing with pipelined block transfer

DOI10.1007/BF02575875zbMATH Open0861.68028OpenAlexW1994923138MaRDI QIDQ1817502FDOQ1817502

Authors: M. Spuri 

Publication date: 8 December 1996

Published in: Calcolo (Search for Journal in Brave)

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

Recommendations

• A model of sequential computation with Pipelined access to memory
• Exploiting locality in LT-RAM computations
• scientific article; zbMATH DE number 3951994

zbMATH Keywords

sequential model of computation

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A parallel algorithm for constructing minimum spanning trees
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• A model of computation for VLSI with related complexity results
• A model of sequential computation with Pipelined access to memory
• Title not available (Why is that?)

Cited In (4)

• Exploiting locality in LT-RAM computations
• Title not available (Why is that?)
• A model of sequential computation with Pipelined access to memory
• Pipelined model parallelism: complexity results and memory considerations

Uses Software

• Quicksort

This page was built for publication: Computing with pipelined block transfer

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