The following pages link to (Q4692501):
Displayed 22 items.
- A scalable record locking scheme for parallel file access (Q678110) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Graph layout for applications in compiler construction (Q1285776) (← links)
- Parallel simulation of individual-based, physiologically structured population models (Q1298681) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Using timed Petri net to model instruction-level loop scheduling with resource constraints (Q1331226) (← links)
- Preconditioned conjugate gradient and finite element methods for massively data-parallel architectures (Q1365994) (← links)
- Parallel image understanding algorithms on MIMD multicomputers (Q1382770) (← links)
- A real-time parallel application: The detection of gravitational waves by a network of heterogeneous workstations (Q1384503) (← links)
- Parallelizable approximate solvers for recursions arising in preconditioning (Q1386504) (← links)
- Massively parallel SIMD simulation of Markovian DEDS: Event and time synchronous methods (Q1901407) (← links)
- Conflict-free allocation of arrays during parallel computations (Q1968522) (← links)
- New results on computable efficiency and its stability for complex networks (Q2491749) (← links)
- Distributed computing on cluster systems (Q2763949) (← links)
- A unified framework for off-line permutation routing in parallel networks (Q3357514) (← links)
- Parallel computing for finite element structural analysis using conjugate gradient method based on domain decomposition (Q3422556) (← links)
- Systolic algorithms for the dynamic programming problem (Q3989775) (← links)
- Analysis of convergence of parallelized pfi for coupled large-scale nonlinear systems (Q4521957) (← links)
- Computing the Scattering Number of Graphs (Q4780531) (← links)
- MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ † (Q4819986) (← links)
- Loop parallelisation for pvm-based distributed-memory systems (Q4955146) (← links)
- A latency tolerant hybrid sparse solver using incomplete Cholesky factorization (Q5317897) (← links)