This work considers the best way to handle a diverse mix of multi-threaded and single-threaded jobs running on a single Symmetric Parallel Processing system. The traditional approaches to this problem are free scheduling, gang scheduling, or space sharing. This paper examines a less common technique called dynamic space sharing. One approach to dynamic space sharing, Automatic Self Allocating T...

Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. An organization structure for intelligent job shop scheduling based on MAS (Multiple Agents System) is put forward to achieve effective and efficient production. A hybrid multilayer agent st...

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, ...

Task scheduling in Grid environment is a challenging problem because of NP-complete nature of scheduling issue and dynamic characteristic of the environment. Not constrained by local scheduling policy of Grid site, a dynamic service evaluation method based on cloud model is presented. Then we obtain performance metrics of dynamic service. According to dynamic service evaluation, an adaptive and...

This paper presents the results of an architecture style evaluation that compares the performance of static scheduling and dynamic scheduling for media processors. Existing programmable media processors have predominantly used staticallyscheduled architectures. As future media processors progress to higher frequencies and higher degrees of parallelism, the dynamic aspects of processing become m...

Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] Scheduler is compared with dynamic, real time, Dependent Activity Scheduling Algorithm (DASA) and Locke’s Best Effort Scheduling Algorithm (LBESA). We abbreviated beneficial result of NMLFQ scheduler in comparison with...

This paper proposes balancing scheduling effort more evenly between the compiler and the processor, by introducing dynamically scheduled Very Long Instruction Word (VLIW) instructions. Dynamically Instruction Scheduled VLIW (DISVLIW) processor is aimed specifically at dynamic scheduling VLIW instructions with dependency information. The DISVLIW processor dynamically schedules each instruction w...

Decision support systems are intended to assist human decision makers. In complex, dynamic domains a proper task apportionment between the computer and the human decision maker largely dictates system success. Task apportionment is even more critical when exceptions are introduced into the system. We examine an airbase logistics scheduling and planning system, a complex and dynamic application ...

Scheduling is an important tool in the manufacturing area since productivity is inherently linked to how well the resources are used to increase efficiency and reduce waste. The present article analyzes and provides comparison of modern techniques used for solving dynamic scheduling problem in flexible manufacturing system. These techniques are often impractical in dynamic real world environmen...