Loading...
Please wait, while we are loading the content...
Similar Documents
Steady-State Scheduling
| Content Provider | Semantic Scholar |
|---|---|
| Author | Marchal, Loris |
| Copyright Year | 2011 |
| Abstract | 1 The context Platform Platform : heterogeneous and distributed : – processors with different capabilities ; – communication links of different characteristics. Applications Application made of a very (very) large number of tasks, the tasks can be clustered into a finite number of types, all tasks of a same type having the same characteristics. Principle When we have a very large number of identical tasks to execute, we can imagine that, after some initiation phase, we will reach a (long) steady-state, before a termination phase. If the steady-state is long enough, the initiation and termination phases will be negligible. Problem : sending a set of message flows. In a communication network, several flow of packets must be dispatched, each packet flow must be sent from a route to a destination, while following a given path linking the source to the destination. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://graal.ens-lyon.fr/~lmarchal/scheduling/05.steady-state-2012.pdf |
| Alternate Webpage(s) | http://graal.ens-lyon.fr/~lmarchal/scheduling/05.steady-state.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Central processing unit Cognitive function: initiation Computer cluster Genetic Heterogeneity Network packet Scheduling (computing) Scheduling - HL7 Publishing Domain Steady state Telecommunications network Traffic flow (computer networking) |
| Content Type | Text |
| Resource Type | Article |
