W. Zhao, K. Ramamritham, and J.A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Trans. Computers, vol. 36, no. 8, pp. 949-960, Aug. 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of processors and communication resources. A task set is a 231 232 collection of task graphs, each of which is a directed acyclic graph (DAG) of communicating tasks. Generation of sample task sets is often a requirement when comparing allocation or scheduling methods with each other [209] [210]. There are generally no standard task sets available, making comparison of different methods all but impossible. Moreover, since task set generation is only a secondary aspect of scheduling research, the details necessary to enable exact recreation of another researcher s task sets are usually ....

W. Zhao, K. Ramamritham, and J. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Trans. on Computers, vol. 36, pp. 949--960, Aug. 1987.

....and a database of processors and communication resources. A task set is a collection of task graphs, each of which is a directed acyclic graph (DAG) of communicating tasks. Generation of sample task sets is often a requirement when comparing allocation or scheduling methods with each other [1] [2]. There are generally no standard task sets available, making comparison of different methods all but impossible. Moreover, since task set generation is only a secondary aspect of scheduling research, the details necessary to enable exact recreation of another re This work was supported in part ....

W. Zhao, K. Ramamrithan, and J. Stankovic, "Preemptive scheduling under time and resource constraints, " IEEE Trans. on Computers, vol. 36, pp. 949--60, Aug. 1987.

....denote the types of machines on which those applications can execute. II. Related Work Many research e#orts in the literature concentrate on scheduling real time applications on a processor (e.g. 26] 27] 28] 29] 30] 31] 32] 33] 34] 35] 36] 37] 38] 39] 40] [41]) The major ways in which our work di#ers from the works cited above are: a) the system environment of our research is very di#erent from most of the previous research (e.g. multitasking heterogeneous distributed machines capable of round robin scheduling only, and executing communicating ....

W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Transactions on Computers, vol. C-36, pp. 949--960, Aug. 1987.

....Kim , Yang Yu # , Shriram B. Gundala # , Sethavidh Gertphol # , Howard Jay Siegel # , Anthony A. Maciejewski # , and Viktor Prasanna # Purdue University # University of Southern California School of Electrical and Computer Engineering Department of Electrical Engineering West Lafayette, IN 47907 1285 USA Los Angeles, CA 90089 2560 USA alis, kim42 ecn.purdue.edu yangyu, gundala, gertphol, prasanna halcyon.usc.edu Colorado State University # Department of Electrical and Computer Engineering Department of Computer Science Fort Collins, CO 80523 1373 USA hj, ....

....environment that includes multitasking on multiple processors with multitasking communication links, continuously running applications, and heterogeneous distributed processors. Some research efforts assume a multiprocessor (sometimes a multi resource) environment (e.g. 11, 15, 22, 41, 47] The research in [11, 15, 47] is not directly applicable because, unlike our research, it does not assume heterogeneous distributed multitasking processors. The work in [8, 24, 40] has the same system model for sensors, tasks, and actuators as the model used in our research. These research ....

[Article contains additional citation context not shown here]

W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, C-36(8):949--960, Aug. 1987.

....the experimental setup and the results for the evaluation of these heuristics. II. Related Work Many research e#orts in the literature concentrate on scheduling real time applications on a processor (e.g. 5] 8] 14] 24] 27] 33] 34] 35] 36] 37] 38] 39] 44] 49] 55] [56]) The major ways in which our work di#ers from the works cited above are: a) the system environment of our research is very di#erent from most of the previous research (e.g. multitasking heterogeneous distributed machines capable of round robin scheduling only, and executing communicating ....

W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, C-36(8):949--960, Aug. 1987.

....systems [34] pioneered by the Spring kernel project [35, 36] was introduced later to describe applications where runtime workload is unknown until admission control time. It resulted in innovative planning based scheduling algorithms that provide online guarantees for dynamically arriving tasks [18, 25, 28, 33, 37, 43, 44]. Task execution times where assumed to be known, e.g. using pre run time code analysis techniques such as [15, 38, 42] The results of the analysis depend on specific platform hardware and operating system. The analysis, therefore, needed to be repeated for each target platform. With the advent ....

W. Zhao, K. Ramamritham, and J. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, 36(8):949--960, August 1987.

....the temporal behavior of the two schedules and prevent the event driven tasks to corrupt the off line plan. The MARS system [8] is an example of a system with entire offline planning of all activities. On the other side of the spectrum, SPRING [14] is using planning and global task migration [16] for handling a variety of constraints online. Its planning efforts are expensive; a dedicated scheduling chip is suggested. In our approach, the online scheduling is very simple as we only compute new deadlines. The use of free resources in offline constructed schedules for aperiodic tasks has ....

W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. In IEEE Transactions on Computers, C-36(8):949--960, Aug. 1987.

....from previous literature which typically assumed full knowledge of the task set and execution requirements. The dynamic real time system model was pioneered by the Spring kernel project [129, 130] which introduced planning based scheduling and online guarantees for randomly arriving tasks [70, 94, 106, 126, 128, 153, 154]. 7.2 Related Work on Operating Systems More recently, resource reservation has been applied for temporal isolation of real time applications [63, 75, 88] in an attempt to safely colocate real time and best effort processing via appropriate operating system support. While earlier real time ....

W. Zhao, K. Ramamritham, and J. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Transactions on Computers, vol. 36, no. 8, pp. 949--960, August 1987.

.... Resource management is an important function in scheduling to avoid undesirable situations like deadlocks or priority inversions [20] 2] 3] A current practice is to allocate all the resources needed by a task at the beginning of its execution and free all the resources when the task ends [40] [39]. This approach leads to a waste of systems resources because a task may need a shared resource during a little time compared with its execution time. Another solution is to decompose a task into several segments that do not ask for any resource. These segments are connected by synchronization ....

W.Zhao, K.Ramamrithan, and J.Stankovic. Preemptive Scheduling under Time and Resource Constraints. IEEE Transactions on Computers, 8(36):949--60, August 1987.

....in various networks have been intensively studied by researchers (e.g. 10, 12, 13, 32] Reference [5] provides an excellent survey on real time communications in packet switched networks. As for multi access networks, there were efforts in extending the CSMA CD protocol to real time systems [23, 31]. Unfortunately, due to their intrinsic randomness in medium access, CSMA CD and its variants are unable to provide a deterministic guarantee on message delivery time. Afterward, fiber distributed data interface (FDDI) was shown to be suitable for real time communications [1, 8] Specifically, the ....

W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Transactions on Computers, vol. C-36, no. 8, pp. 949--960, August 1987. 48

....the Spring kernel project [36, 37] introduced the third major paradigm to describe applications where run time workload parameters are unknown until admission control time. It resulted in innovative planning based scheduling algorithms that provide online guarantees for dynamically arriving tasks [17, 25, 28, 34, 38, 46, 47]. Task execution times where assumed to be known, e.g. using pre run time code analysis techniques such as [14, 39, 45] With the advent of a new category of soft real time applications such as multimedia, real time databases, and e commerce, the concept of QoS adaptation was introduced into ....

W. Zhao, K. Ramamritham, and J. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, 36(8):949--960, August 1987.

No context found.

W. Zhao, K. Ramamritham and J. A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Transactions on Computers 36(8), 1987.

....to design the system with sufficient resources, because of cost and highly unpredictable environments, it is sometimes impossible to guarantee that the system resources are sufficient. In this case, EDF s performance degrades rapidly in overload situations. The Spring scheduling algorithm [Rama84][Zhao87] can dynamically guarantee incoming tasks via on line admission control and planning and thus is applicable in resource insufficient environments. Many other algorithms (e.g. RED algorithm [Butt95] have also been developed to operate in this way. This planning based set of algorithms represents ....

W. Zhao, K. Ramamritham and J. A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints", 1EEE Transactions on Computers 36(8), 1987.

....execution times for that software on specific hardware as well as what data that software needs to share in exclusive mode. All of this information can be part of the configuration tool set. Given knowledge of all these things it is then possible to use the Spring scheduling off line algorithm [45], designated as H( in the figure, to compute a feasible schedule where all deadlines and exclusion constraints are met, or be told that no such schedule was found. See Figure 2. In figure 2 it is shown that task A is scheduled on one CPU, while tasks B and C are on a second CPU. Resources R1 ....

Zhao, W., Ramamritham, K., and Stankovic, J., (1987) Preemptive Scheduling Under Time and Resource Constraints, Special Issue of IEEE Transactions on Computers on Real-Time Systems, Vol. C-36, No. 8, pp. 949-960. This article was processed using the L A T E X macro package with LLNCS style

....real time system, we must be able to manage both the logical complexity and timing complexity by using a disciplined approach. The logical complexity is addressed by software engineering methodology, while the timing complexity is addressed by research in real time scheduling algorithms [2, 3, 5, 6, 7, 8, 10, 12, 14]. An important class of scheduling algorithms is known as static priority scheduling algorithms. These algorithms have several attractive properties. First, they are simple to implement. Second, they have good performance. The utilization bound of a randomly chosen periodic task set is 88 [4] ....

Zhao, W., Ramamritham, K., and Stankovic, J. Preemptive Scheduling Under Time and Resource Constraints. IEEE Transactions on Computers , August 1987. 2 CMU/SEI-88-TR-34 CMU/SEI-88-TR-34 i

No context found.

W. Zhao, K. Ramamritham, and J.A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Trans. Computers, vol. 36, no. 8, pp. 949-960, Aug. 1987.

No context found.

W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Trans. on Computers, C-36(8):949--960, Aug. 1987. 35

No context found.

W. Zhao, K. Ramamritham, and J. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, 36(8):949--960, August 1987.

No context found.

W. Zhao, K. Ramamritham, and J. Stankovic, "Preemptive Scheduling under Time and Resource Constraints," IEEE Trans. Computers, vol. 36, no. 8, pp. 949-960, Aug. 1987.

No context found.

W. Zhao, K. Ramamritham, and J.A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Trans. on Computers, August 1987, pp. 949-960.

No context found.

W. Zhao, K. Ramamritham, and J. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, 36(8):949--960, August 1987.

No context found.

W. Zhao, K. Ramamritham, and J. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Transactions on Computers, Volume 36, Number 8, pages 949-960, August 1987.

No context found.

W. Zhao, K. Ramamritham, and J. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Trans. Comput., page 949, 1987.

No context found.

W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Transactions on Computers, vol. C-36, no. 8, pp. 949--960, August 1987.

No context found.

W. Zhao, K. Ramamritham, and J.A. Stankovic. Preemptive Scheduling Under Time and Resource Constraints. IEEE Transactions on Computers, 36(8):949--960, August 1987.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC