The following pages link to Peter J. Varman (Q818671):
Displaying 27 items.
- Optimal read-once parallel disk scheduling (Q818672) (← links)
- Parallel merging: Algorithm and implementation results (Q916383) (← links)
- (Q1104745) (redirect page) (← links)
- Geometric problems on two-dimensional array processors (Q1104746) (← links)
- An efficient parallel algorithm for updating minimum spanning trees (Q1105383) (← links)
- Fault-tolerance VLSI sorters (Q1108014) (← links)
- Merging multiple lists on hierarchical-memory multiprocessors (Q1177094) (← links)
- Markov analysis of multiple-disk prefetching strategies for external merging (Q1330430) (← links)
- Analysis of simple randomized buffer management for parallel I/O (Q2390215) (← links)
- Modular Matrix Multiplication on a Linear Array (Q3334071) (← links)
- A Robust Matrix-Multiplication Array (Q3336684) (← links)
- RFQ: Redemptive Fair Queuing (Q3541111) (← links)
- (Q3687714) (← links)
- (Q3692849) (← links)
- (Q3725547) (← links)
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays (Q3757394) (← links)
- (Q3773332) (← links)
- Optimal matrix multiplication on fault-tolerant VLSI arrays (Q3823791) (← links)
- Competitive Parallel Disk Prefetching and Buffer Management (Q4500851) (← links)
- PC-OPT: optimal offline prefetching and caching for parallel I/O systems (Q4571249) (← links)
- (Q4790070) (← links)
- (Q4893461) (← links)
- (Q4942236) (← links)
- (Q4945532) (← links)
- Lexicographically optimal smoothing for broadband traffic multiplexing (Q5170868) (← links)
- <i>d</i> -clock (Q5401442) (← links)
- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems (Q6567769) (← links)
