Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9:207--239, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and migration constraints are on the y axis. In general, increasing distance from the origin may imply greater generality. Of these nine classes, 1, 1) 2, 1) and (3, 3) restricted algorithms have received the most attention. For example, 1, 1) restricted algorithms have been studied in [7, 11, 21, 22], while (2, 1) restricted algorithms (and equivalently, 3, 1) restricted algorithms) have been studied in [8, 9, 11] The class of (3, 3) restricted algorithms has been studied in [1, 5, 16, 24] In addition to these, 1, 3) and (2, 3) restricted algorithms were recently considered in [4] and ....

....of Realtime Tasks on Multiprocessors in this volume. We now briefly describe results relating to the remaining classes of scheduling algorithms. 4. 1 Partitioning Approaches There has been a considerable amount of research on (x, 1) restricted scheduling algorithms, i.e. partitioning approaches [7, 9, 11, 18, 22, 23]. Recall that, under partitioning, each task is assigned to a processor on which it will exclusively execute. Finding an optimal assignment of tasks to processors is equivalent to a bin packing problem, which is known to be NP hard in the strong sense. Several polynomial time heuristics have been ....

[Article contains additional citation context not shown here]

Y. Oh and S. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-time Systems, 9(3):207--239, 1995.

....many other available partitioning heuristics will likely be impractical for online scheduling. Despite this, partitioning is beneficial in that, once tasks are assigned to processors, each processor can be scheduled independently using uniprocessor scheduling algorithms such as RM and EDF [8, 13, 27, 31, 36]. One of the most popular approaches is RM FF, in which the FF heuristic is used to assign tasks to processors, which are scheduled using the RM algorithm. The popularity of this approach stems largely from the popularity of RM as a uniprocessor scheduling algorithm. One reason for RM s popularity ....

Yingfeng Oh and Sang H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. RealTime Systems, 9(3):207--239, 1995.

....to available processors. Different flavors of this are proposed in [9, 15, 16] For the special case of fixed priority scheduling on homogeneous multiprocessor systems, rate monotonic analysis has been used to derive near optimal task clustering policies taking into consideration task periods [17, 18]. In general, clustering heuristics, such as those in [9, 15] typically require the knowledge of module execution times and intermodule communication overhead. Computing these values, which depend on processor speed and link bandwidth, requires a priori knowledge of task to processor assignment. ....

Y. Oh and S. Son, "Allocating fixed-priority periodic tasks on multiprocessor systems," Journal of Real-Time Systems, vol. 9, no. 3, , September 1995.

....an assignment of processes to processors such that the total communication cost is minimized, under the constraints that every process is assigned to exactly one processor and the sum of the utilization factors of all processes on any one processor is less than the maximum utilization factor U. [Buchard94, Buchard95, Oh95] took a different approach for developing process assignment schemes for homogeneous multiprocessor systems where individual processors execute the RM scheduling algorithm. Rather than increasing the level of sophistication of the bin packing heuristic, they focused on developing tighter ....

Y. Oh and S.H. Son, "Allocating fixed-priority periodic tasks on multiprocessor systems", Real-Time Systems, vol. 9, pp. 207-239, 1995.

....some constraints on task features. As for the multiprocessor systems, the Rate Monotonic algorithm was generalised by Dhall and Liu [5] who proposed the two heuristics called Rate Monotonic First Fit (RMFF) and Rate Monotonic Next Fit (RMNF) Recently they were improved upon by Oh and Son [12]. The distributed algorithms proposed in [13] address the issue of dynamic scheduling. As for fault tolerant scheduling, some algorithms were presented in [2, 4, 7, 11, 14] This paper presents the Fault Tolerant DeadlineMonotonic (FTDM) algorithm which extends the RMFF algorithm to a ....

Y. Oh and S. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9:207--239, 1995.

....method requires that the task set has been divided into partitions, each having its own dedicated processor. Since an optimal solution to the problem of partitioning the tasks is believed to be computationally intractable, many heuristics for partitioning have been proposed (see for example [3, 6, 7, 8, 9, 10]) All of these bin packing based partitioning algorithms provide performance guarantees, they all exhibit fairly good average case performance, and they can all be applied in polynomial time (using sufficient schedulability tests) The non partitioned method has received considerably less ....

.... partitioning algorithms are studied, namely RM FFDU [8] and R BOUND MP [9] The reason for selecting these two latter algorithms is that we have found that they are the partitioning algorithms which provide the best performance in our experimental environment (other algorithms, such as RRM BF [7] and RMGT [6] offer lower performance) For all partitioning algorithms, we use the corresponding sufficient schedulability test. We have also evaluated a hybrid partitioned nonpartitioned algorithm, which we will call RMFFDU adaptiveTkC. The reason for considering a hybrid solution is that we ....

Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207-- 239, November 1995.

....ready queue, but a task can be bound to only be dispatched by one processor) Figure 2 shows different ways of inserting tasks in a ready queue.LAL is used in loosely coupled distributed systems which do not move tasks between processors. Several task allocation algorithms for LAL exist [23, 24]. LAM is used by algorithms such as [25, 26] AS is used in symmetric multiprocessor systems which lack the support to assign a task on a specific processor. Linux is currently of the type AS. ASB is used in some symmetric multiprocessor systems where a task may be allowed to dispatched on any ....

Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995.

.... to encompass a single fault occurring every interval of time, for both uniprocessors and multiprocessor systems [BJPG89, GMM94, GMM97] Further, tolerance to transient faults for periodic tasks has also been addressed for uniprocessors [RT93, RTS94, OS94, PM98, GMM98] and multiprocessor systems [BMR99, OS95, LMM98]. In [KS86] processor failures are handled by maintaining contingency or backup schedules. These schedules are used in the event of a processor failure. To generate the backup schedule, it is assumed that an optimal schedule exists and the schedule is enhanced with the addition of ghost tasks, ....

Y. Oh and S. Son. Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems. Real-Time Systems Journal, 9:207--239, 1995.

....GRMS when worst case computation times can be inaccurate. It is shown that in this case, GRMS outperforms the best partitioning scheme. The conclusion is presented in Section 5. 2 Motivation Most multiprocessor scheduling techniques proposed in the literature are based on a partitioning scheme [4, 3, 1, 9]. Because a global scheduling scheme relaxes the constraint that a task must always execute on the same processor, one would expect global schemes to achieve a higher processor utilization than partitioning schemes. However, this is not the case. In [4] Dhall and Liu showed that a multiprocessor ....

Y. Oh and S. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems Journal, 9:207--239, 1995.

No context found.

Y. Oh and S.H. Son, Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems, re-submitted to Real-Time Systems Journal, February 1994.

....and only if its total utilization is no more than one. Although the schedulability condition, i.e. given by Liu and Layland is simple and elegant, they are pessimistic in nature since the condition is derived under the worst case conditions. Several more efficient conditions were later derived [4, 2, 10, 11]. All these conditions are sufficient but not necessary. The necessary and sufficient condition to schedule a set of periodic tasks using fixed priority algorithms was given by Joseph and Pandya [6] and by Lehoczky, Sha, and Ding [7] The results about Rate Monotonic scheduling are presented in ....

....J. WHITEHEAD. On the Complexity of Fixed Priority Scheduling of Periodic, Real Time Tasks, Performance Evaluation 2: 237 250 (1982) 9] C.L. LIU AND J. LAYLAND. Scheduling Algorithms for Multiprogramming in a Hard 18 Real Time Environment, J. Assoc. Comput. Machinery 10(1) 174 189 (1973) [10] Y. OH AND S.H. SON. Allocating Fixed priority Periodic Tasks on Multiprocessor Systems, Journal of Real Time Systems (to appear) 11] Y. OH. The Design and Analysis of Scheduling Algorithms for Real Time and Fault Tolerant Computer Systems. Ph.D. Dissertation, Dept. of Computer Science, ....

[Article contains additional citation context not shown here]

Y. OH AND S.H. SON. "Allocating Fixed-priority Periodic Tasks on Multiprocessor Systems, " Journal of Real-Time Systems (to appear).

No context found.

Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9:207--239, 1995.

No context found.

O. Yingfeng and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995.

No context found.

Y. Oh and S. H. Son, \Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems, " Real-Time Systems, 9, pp. 207-239, 1995.

No context found.

O. Yingfeng and S.H. Son, "Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems," Real-Time Systems, vol. 9, no. 3, pp. 207-239, Nov. 1995.

No context found.

O. Yingfeng and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995.

No context found.

Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995.

No context found.

Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995.

No context found.

O. Yingfeng and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems, 9(3):207--239, November 1995. This paper exceeds the conference page limit of 10 pages. The author will purchase 2 additional pages as is usually permitted in RTSS/RTAS.

No context found.

Y. Oh and S. H. Son, "Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems," Real-Time Systems, vol. 9, no. 3, pp. 207--239, Nov. 1995.

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