Trade-offs between communication throughput and parallel time (Q5906374): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel Sorting with Limited Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Threshold and Symmetric Functions in Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cryptanalytic time-memory trade-off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for message routing in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of universal hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2log n) parallel max-flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-Offs between Depth and Width in Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer / rank
 
Normal rank

Latest revision as of 20:06, 28 May 2024

scientific article; zbMATH DE number 1286777
Language Label Description Also known as
English
Trade-offs between communication throughput and parallel time
scientific article; zbMATH DE number 1286777

    Statements

    Trade-offs between communication throughput and parallel time (English)
    0 references
    0 references
    0 references
    0 references
    11 May 1999
    0 references
    0 references
    communication throughput
    0 references
    parallel computation
    0 references
    0 references