BROWSE
Detail
Conference Paper
A Static Task Scheduling Method for Safety-critical Distributed Systems
Cited - time in 
Share 
Share
- Authors
- Jeman Park, Taeho Kim
- Issue Date
- 2016-05
- Citation
- IEMEK Symposium on Embedded Technology (ISET) 2016, pp.1-2
- Publisher
- 대한임베디드공학회
- Language
- Korean
- Type
- Conference Paper
- Abstract
- Traditional real-time embedded systems was small-scale and independent. However, recently they are increasingly being connected to create large-scale distributed system. Also, there are many researches about software platform for large-scale distributed system. Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel machine is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper proposed a static task scheduling method for safety-critical distributed systems. The input graph is an acyclic precedence graph, where a node has different execution time on different systems.
- KSP Keywords
- Distributed System(DS), NP-Complete, Optimal scheduling, Parallel tasks, Precedence graph, Safety-Critical, Scheduling method, Small-scale, Task Scheduling, execution time, heterogeneous environment