Pages that link to "Item:Q1208577"
From MaRDI portal
The following pages link to A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors (Q1208577):
Displayed 11 items.
- Two-way dominant sequence clustering for processor scheduling (Q1318742) (← links)
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
- Communication contention in APN list scheduling algorithm (Q2267003) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS (Q4366900) (← links)
- Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
- A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS (Q4820138) (← links)
- CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS (Q5291296) (← links)
- List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity (Q5445761) (← links)
- Revisiting communication code generation algorithms for message-passing systems (Q5481726) (← links)
- Automatic implementation of affine iterative algorithms: Design flow and communication synthesis (Q5950533) (← links)