Pages that link to "Item:Q3994933"
From MaRDI portal
The following pages link to Partitioning and scheduling parallel programs for multiprocessors (Q3994933):
Displaying 40 items.
- Methods of resource management in problem-oriented computing environment (Q300377) (← links)
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
- Parallel partitioning for distributed systems using sequential assignment (Q362566) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems (Q543079) (← links)
- Extending IC-scheduling via the sweep algorithm (Q666039) (← links)
- Optimal partitioning and granularity of uniform task graphs (Q756400) (← links)
- Scalable and structured scheduling (Q862862) (← links)
- Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
- Structured partitioning of concurrent programs for execution on multiprocessors (Q919807) (← links)
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
- A parallelization of adaptive task partitioning algorithms (Q1106613) (← links)
- The partitioning of QSDF computation graphs (Q1117692) (← links)
- Cluster partitioning approaches to mapping parallel programs onto a hypercube (Q1262751) (← links)
- Analysis of a heuristic for code partitioning (Q1264540) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- Two-way dominant sequence clustering for processor scheduling (Q1318742) (← links)
- Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods (Q1344340) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Parallelising large irregular programs: An experience with Naira (Q1394872) (← links)
- Locality-aware task scheduling for homogeneous parallel computing systems (Q1616565) (← links)
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
- Robust scheduling of metaprograms (Q1850712) (← links)
- An efficient heuristic for code partitioning (Q1978622) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Communication Contention Reduction in Joint Scheduling for Optical Grid Computing (Q3556661) (← links)
- Clustering and scheduling method based on task duplication (Q3610418) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS (Q3646175) (← links)
- COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS* (Q4366892) (← links)
- SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS (Q4366900) (← links)
- Reducing Rollbacks Through Partitioning in PCS Parallel Simulation (Q4420156) (← links)
- (Q4737347) (← 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)
- On-line scheduling of parallel jobs (Q5096875) (← links)
- Resource-Oriented Partitioning for Multiprocessor Systems with Shared Resources (Q5228965) (← links)
- Parallel Processing and Applied Mathematics (Q5307370) (← links)
- Thread scheduling for multiprogrammed multiprocessors (Q5946213) (← links)
- Automatic implementation of affine iterative algorithms: Design flow and communication synthesis (Q5950533) (← links)
