| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper ...

This paper proposes an algorithm that allows fully utilize the Central Processing Unit–Graphics Processing Unit (CPU–GPU) hybrid architecture to conduct parallel computation and reasonable scheduling for computer simulation of electrocardiogram (ECG). This algorithm is realized by accelerating calculation speed and increasing platform adaptability of the parallel algorithm. Today, many algorith...

In this paper, we study a dynamic parallel machine scheduling problem with release times, where the release times and processing times of jobs may change during the production process due to uncertainties. The problem is different from classical scheduling problems in the deterministic environment where all information of jobs is known at the beginning of the scheduling horizon and will not cha...

In this paper we will model a Manufacturing System by means of a Multi-Agent Systems, where each agent may represent a processing entity. This work has as objective to deal with the complex problem of Dynamic Scheduling in Manufacturing Systems. We want to prove that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and...

In this paper, we consider the generalized power model in which the focus is the dynamic power and the static power, and we study the problem of the canonical sporadic task scheduling based on the ratemonotonic (RM) scheme. Moreover, we combine with the dynamic voltage scaling (DVS) and dynamic power management (DPM). We present a static low power sporadic tasks scheduling algorithm (SSTLPSA), ...

Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper, we propose a technique called dynamic grouping, to be used with backup overloading in a primary-backup based fault-tolerant dynamic scheduling algorithm in multiprocessor real-time systems. In d...

In this paper Upgraded Maximum Urgency First (UMUF) scheduling algorithm has been proposed. This algorithm is a further improvement in MMUF algorithm [1] and is a mixed priority scheduling algorithm which combines the advantages of both fixed and dynamic scheduling for better CPU utilization and throughput. The prime objective of this paper is to improve modified maximum urgency first schedulin...

Hardware designs typically combine parallelism and resourcesharing; a circuit’s correctness relies on shared resources being accessed mutually exclusively. Conventional high-level synthesis systems guarantee mutual exclusion by statically serialising access to shared resources during a compile-time process called scheduling. This approach suffers from two problems: (i) there is a large class of...

Scheduling decisions in time-critical systems are very difficult, due to the vast number of systems’ parameters and tasks’ attributes involved in such decisions. Due to the intractability of the problem, time-critical systems often have to resort to heuristic techniques. Value-based scheduling heuristics have been found in the literature to experience a more graceful degradation under overload ...

A computational grid is a highly dynamic and distributed environment. Unlike tightly-coupled parallel computing environment, high performance computing on the grid is complicated by the heterogeneous computational performances of each node, possible node unavailability, unpredictable node behavior, and unreliable network connectivity. Compared to a static scheduling, an adaptive scheduling mech...