Towards an Architecture-Independent Analysis of Parallel Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1728436
- Architecture independent parallel algorithm design: theory vs practice
- scientific article; zbMATH DE number 108570
- scientific article; zbMATH DE number 53193
- scientific article; zbMATH DE number 4020458
- Towards structured parallel computing on architecture-independent parallel algorithm design for distributed-memory architectures
- scientific article; zbMATH DE number 729658
- Practical considerations of parallel simulations and architecture independent parallel algorithm design
- scientific article; zbMATH DE number 107950
Cited in
(55)- Task scheduling with and without communication delays: A unified approach
- On the complexity of scheduling with large communication delays
- Scheduling inverse trees under the communication model of the LogP-machine
- A method for estimating resources required for implementation of finite algorithms
- Two-way dominant sequence clustering for processor scheduling
- On high level characterization of parallelism
- Three, four, five, six, or the complexity of scheduling with communication delays
- Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- Architecture-independent parallelism for both shared- and distributed-memory machines using the Filaments package
- On scheduling send-graphs and receive-graphs under the LogP-model
- A very difficult scheduling problem with communication delays
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Towards structured parallel computing on architecture-independent parallel algorithm design for distributed-memory architectures
- New complexity results on scheduling with small communication delays
- Scheduling tree dags on parallel architectures
- Computing the execution probability of jobs with replication in mixed-criticality schedules
- How to pack directed acyclic graphs into small blocks
- ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
- Communication contention in APN list scheduling algorithm
- Architecture adaptive algorithms
- Scheduling trees with large communication delays on two identical processors
- scientific article; zbMATH DE number 1630112 (Why is no real title available?)
- Scheduling with duplication on m processors with small communication delays
- Analysis of the Parallel Distinguished Point Tradeoff
- scientific article; zbMATH DE number 425387 (Why is no real title available?)
- Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
- scientific article; zbMATH DE number 4137301 (Why is no real title available?)
- Computational force: a unifying concept for scalability analysis
- Scheduling Precedence Task Graphs with Disturbances
- scientific article; zbMATH DE number 1830922 (Why is no real title available?)
- Parallel Machine Scheduling with Uncertain Communication Delays
- scientific article; zbMATH DE number 862263 (Why is no real title available?)
- Scheduling 2-dimensional grids with large communication delays
- CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
- Guidelines for data-parallel cycle-stealing in networks of workstations. II: On maximizing guaranteed output
- On message packaging in task scheduling for distributed memory parallel machines
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
- Scheduling with uncertainties on new computing platforms
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- scientific article; zbMATH DE number 7650084 (Why is no real title available?)
- Some models for scheduling parallel programs with communication delays
- Data transmission in processor networks
- Malleable scheduling beyond identical machines
- Optimizing latency and throughput of application workflows on clusters
- Bounds and algorithms for a practical task allocation model (extended abstract)
- Multilevel algebraic approach for performance analysis of parallel algorithms
- List scheduling with duplication for heterogeneous computing systems
- Reliability-aware scheduling strategy for heterogeneous distributed computing systems
- Scheduling jobs with shared additional operations on parallel identical machines
- Complexity and approximation algorithm for scheduling communication delays problem with limited communication resource
- Approximating schedules for dynamic process graphs efficiently
- Sensitivity bounds for machine scheduling with uncertain communication delays
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
This page was built for publication: Towards an Architecture-Independent Analysis of Parallel Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034819)
