scientific article; zbMATH DE number 3991267
From MaRDI portal
Publication:3753798
Recommendations
- Nonpreemptive scheduling of arbitrary machines
- Algorithms for solving minimax scheduling problem
- Efficiency of the methods of scheduling complex sets of tasks in nonuniform multiprocessor computer systems
- scientific article; zbMATH DE number 1157215
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
Cited In (29)
- Title not available (Why is no real title available?)
- Search techniques for a nonlinear multiprocessor scheduling problem
- Efficiency of the methods of scheduling complex sets of tasks in nonuniform multiprocessor computer systems
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- A high level dynamic programming algorithm for processing nonserial looped systems
- A new approach to optimal cache scheduling
- Nonpreemptive scheduling of arbitrary machines
- Scheduling Multipipeline and Multiprocessor Computers
- Dynamic programming in the design of real-time multiprocessor systems
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
- Design of computational processes in hierarchic systems
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- The optimal control approach to generalized multiprocessor scheduling
- Aggregation in the task of composition of the optimal schedule for multiprocessor automated control systems
- Models and algorithms for minimization of the cost of executing certain tasks in uniform multiprocessor computer systems
- Simultaneous scheduling and assignment of processes as a method of optimization of architectural solutions of computer systems
- Title not available (Why is no real title available?)
- An algorithm for constructing single processor static-dynamic schedules
- Title not available (Why is no real title available?)
- Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories
- Task matching and scheduling for smart homogeneous multiprocessor systems
- Title not available (Why is no real title available?)
- Algorithms for solving minimax scheduling problem
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753798)