Name
Abstract | ||
|---|---|---|
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode changes. While concepts are available, that deal with discrete operation modes, the continuous case is unsolved. In this paper some ideas of how to tackle the scheduling problem with continuous mode changes are discussed. It is assumed that in mechatronic systems not all modes are realistic. A higher requirement in one system component may exclude higher requirements in other components. We expect that such dependencies are specified in the technical specification of the mechatronic system, and from them the domain of realistic modes can be derived. In this paper, we discuss two optimization problems: (1) Given a set of hosts, find a minimum number of allocations that feasibly cover the whole domain of realistic modes. (2) In the design phase one would like to minimize the number of processors for which such a set of allocations exists. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ENC.2004.1342635 | ENC |
Keywords | Field | DocType |
mechatronic system,continuous case,higher requirement,paper deal,dynamic mechatronic system,mechatronic systems,continuous mode change,continuous mode changes,minimum number,discrete operation mode,realistic mode,different operation mode,resource allocation,mechatronics,scheduling problem,optimization problem,scheduling,sensors | Continuous mode,Job shop scheduling,Scheduling (computing),Computer science,Resource allocation,Mechatronics,Optimization problem,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2160-6 | 1 | 0.37 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus Ecker | 1 | 41 | 9.16 |
| Andrei Tchernykh | 2 | 427 | 50.05 |
| Frank Drews | 3 | 11 | 1.39 |
| Silke Schomann | 4 | 4 | 1.57 |