Pages that link to "Item:Q3034819"

The following pages link to Towards an Architecture-Independent Analysis of Parallel Algorithms (Q3034819):

Displaying 39 items.

• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
• Optimizing latency and throughput of application workflows on clusters (Q645499) (← links)
• List scheduling with duplication for heterogeneous computing systems (Q666063) (← links)
• Reliability-aware scheduling strategy for heterogeneous distributed computing systems (Q666213) (← links)
• Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
• Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
• Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
• Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
• On the complexity of scheduling with large communication delays (Q1278302) (← links)
• Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
• Two-way dominant sequence clustering for processor scheduling (Q1318742) (← links)
• Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
• Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods (Q1344340) (← links)
• Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530) (← links)
• On scheduling send-graphs and receive-graphs under the LogP-model (Q1603551) (← links)
• A very difficult scheduling problem with communication delays (Q1604057) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• New complexity results on scheduling with small communication delays (Q1894375) (← links)
• Scheduling tree dags on parallel architectures (Q1911467) (← links)
• Computing the execution probability of jobs with replication in mixed-criticality schedules (Q2069250) (← links)
• How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems (Q2218451) (← links)
• Communication contention in APN list scheduling algorithm (Q2267003) (← links)
• Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
• (Q2741503) (← links)
• Scheduling Precedence Task Graphs with Disturbances (Q4467894) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL (Q5249015) (← links)
• GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT (Q5249035) (← links)
• ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES (Q5249258) (← links)
• AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE (Q5315922) (← links)
• (Q5875469) (← links)
• Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
• Data transmission in processor networks (Q6084553) (← links)
• Malleable scheduling beyond identical machines (Q6090217) (← links)
• Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)