Architecture of Computing Systems (Lecture Notes in Computer ...

Recommendations

Info

90 J.-P. Steghöfer et al. mechanisms [5] and involve detecting cycles in the wait-for graphs when the dependency relations between agents are known locally by using serialization techniques or resource allocation logic in operating systems [10]. However, the primary realm of related work that is relevant for the self-organizing resourceflow systems considered in this paper stems from the domain of manufacturing control and Flexible Manufacturing Systems (FMS). For an overview of such approaches, see, [14]. Several proposed Deadlock Prevention strategies are based on the use of transition systems, mostly Petri nets. [19] provides a mechanism to generate an automated supervisor to check for deadlocks in the given Petri nets and hence prevent them from occurring. A survey of techniques using Petri nets has been made by Zhi Wu Li et al. [23] with respect to AGV (Automated Guided Vehicle) systems in manufacturing. Siphon based policies are shown to achieve a good balance of the best of all properties of the Petri net based methods [18]. However all these techniques rely on known interactions between the agents (mostly the AGVs in the referred cases) and restrict transitions to states that could lead to a deadlock based on a universal control policy generated during Petri net analysis. The methods discussed above all require a global view of the system, offline computation or computation during the design phase. The deadlock prevention approach establishes the control policy in a static way, so that, once established, it is guaranteed that the system cannot reach a deadlock situation if the system is not changed [13]. Serial execution of the processes on the resource like scheduling in the case of software processes or threads involves assumptions or knowledge of the time of execution which might not be available. The computations required can become infeasible for large scale systems. Deadlock Avoidance mechanisms using Petri nets [33,17] restrict the maximal number of parts that can be routed into the system. The Petri nets are either constructed upfront or constructed dynamically which involves a communication overhead. A Petri net allows to check at each state whether the next state would lead to a deadlock or not. This analysis can be used to obtain suitable constraint policies for the system [3,33]; a similar mechanism has also been utilized for deadlocks in software programs [30] using supervisory control of Petri nets. A resource-allocation graph can be used to construct a local graph to check for deadlocks based on a global classification of agents into deadlock risk and deadlock free agents and combines the restrictions of deadlock prevention with the flexibility of deadlock avoidance [34]. [6] also uses a resource-allocation graph in which resource allocation and release is modelled by the insertion and deletion of edges. Deadlock avoidance is achieved by prohibiting actions that would lead to the insertion of an edge that would make the graph cyclic. If the components of a system know the nature of all the jobs they will be performing and all the components they will be communicating with in advance, deadlocks can be avoided in a distributed fashion [27]. Deadlock Detection and Resolution [28] often involves construction of a wait-for graph [7]. A wait-for graph is a graph to track which other agent an agent is currently blocking on. Maintaining such a global picture or agent state involves
On Deadlocks and Fairness in Self-organizing Resource-Flow Systems 91 a lot of communication overhead while locally distributed deadlock detection schemes like Goldman’s Algorithm [15] pass information locally to agents in the form of tables or other data sets. Ashfield et al. [2] provide dedicated agents for deadlock initiation, detection and resolution in a system with mobile agents. Deadlock Recovery Mechanisms using buffers [32] or rollback propagation [31] have been proposed. Livelocks are closely related to deadlocks [1] but have not been dealt with as rigorously as deadlocks have been. A combination of different formal methods is used in [9] to check a system for livelock freedom at design time. Similarly, [20] introduces a type system that can be used to prove that processes and their communication are deadlock- and livelock-free. In [22], the author examines different characterizations of fairness in tracebased systems and explores the practical usefulness of generalized fairness properties. [4] introduces least fairness, a property that is sufficient to show freedom of starvation as well as the concept of conspiracy that describes how concurrent processes interact to induce starvation. Parametric fairness, a fairness measure based on a probabilistic model is used in [29] to show that most executions of concurrent programs are fair. Markov Models are used to study unfairness and starvation in CSMA/CA protocols [12]. 4 Self-organising Resource-Flow Systems In order to analyse, specify, model, and construct self-organising resource-flow systems, the Organic Design Pattern (ODP) has been developed [16]. It describes self-organizing systems in terms of agents that process resources by applying capabilities according to roles. Roles are data structures that contain a precondition, a list of capabilities to apply and a postcondition ODP is part of a methodology that contains a design guideline, the pattern description with its static and dynamic parts as well as methods and tools for formally verifying properties of systems modelled with ODP. In the following, only the relevant parts of the pattern will be described. More information can be found in the cited resources. 4.1 Set-Based Description of ODP An ODP system consists – among other things – of a set agents of the agents in the system, a set capabilities which is the set of all capabilities in the system and a set roles which denotes the set of all possible roles in the system. An agent ag ∈ agents consists of two sets of agents (inputag and outputag), the former one defining the agents from which ag may accept resources and the latter one to which ag may give resources, as well as a set capag of capabilities the agent can apply and a set rolesag which determine the function of the agent in the system. A condition c is an element of the set conditions, containing an agent to exchange a resource with, a sequence of capabilities 1 that have been applied to a 1 In this definition, capabilities is treated as an alphabet whose symbols can form words which describe the state, task and capabilities to apply to a resource.
Page 2 and 3:
Lecture Notes in Computer Science 5
Page 4 and 5:
Volume Editors Christian Müller-Sc
Page 6 and 7:
General Chair Organization Christia
Page 8 and 9:
Organization IX Hartmut Schmeck Kar
Page 10 and 11:
Keynote Table of Contents HyVM - Hy
Page 12 and 13:
Table of Contents XIII JetBench:AnO
Page 14 and 15:
How to Enhance a Superscalar Proces
Page 16 and 17:
4 J. Mische et al. The Real-time Vi
Page 18 and 19:
6 J. Mische et al. 4.1 Instruction
Page 20 and 21:
8 J. Mische et al. Additionally the
Page 22 and 23:
10 J. Mische et al. % of unused pip
Page 24 and 25:
12 J. Mische et al. % of cycles spe
Page 26 and 27:
14 J. Mische et al. 16. Lickly, B.,
Page 28 and 29:
16 G. Aşılıoğlu, E.M. Kaya, and
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
26 T.B. Preußer, P. Reichel, and R
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
38 P. Bellasi, W. Fornaciari, and D
Page 52 and 53: 40 P. Bellasi, W. Fornaciari, and D
Page 62 and 63: 50 J. Zeppenfeld and A. Herkersdorf
Page 74 and 75: 62 B. Jakimovski, B. Meyer, and E.
Page 86 and 87: 74 M. Bonn and H. Schmeck Fig. 1. J
Page 88 and 89: 76 M. Bonn and H. Schmeck 2.2 Node
Page 90 and 91: 78 M. Bonn and H. Schmeck Uptime-ba
Page 92 and 93: 80 M. Bonn and H. Schmeck 2.4 Simul
Page 94 and 95: 82 M. Bonn and H. Schmeck done rate
Page 96 and 97: 84 M. Bonn and H. Schmeck Fig. 8. J
Page 98 and 99: 86 M. Bonn and H. Schmeck tells the
Page 100 and 101: 88 J.-P. Steghöfer et al. � �
Page 104 and 105: 92 J.-P. Steghöfer et al. resource
Page 106 and 107: 94 J.-P. Steghöfer et al. Choose a
Page 108 and 109: 96 J.-P. Steghöfer et al. 1. Defin
Page 110 and 111: 98 J.-P. Steghöfer et al. and all
Page 112 and 113: 100 J.-P. Steghöfer et al. 19. Kim
Page 114 and 115: 102 K. Kloch et al. large-scale sys
Page 116 and 117: 104 K. Kloch et al. a�t� 1.0 0.
Page 118 and 119: 106 K. Kloch et al. constant. This
Page 120 and 121: 108 K. Kloch et al. Relative number
Page 122 and 123: 110 K. Kloch et al. (a) infection r
Page 124 and 125: 112 K. Kloch et al. (ii) Phase of a
Page 126 and 127: 114 P. Petoumenos et al. Studying t
Page 128 and 129: 116 P. Petoumenos et al. % of Misse
Page 130 and 131: 118 P. Petoumenos et al. IQ: n 4-in
Page 132 and 133: 120 P. Petoumenos et al. downsizing
Page 134 and 135: 122 P. Petoumenos et al. As long as
Page 136 and 137: 124 P. Petoumenos et al. comparable
Page 138 and 139: Exploiting Inactive Rename Slots fo
Page 140 and 141: 128 M. Kayaalp et al. In a supersca
Page 142 and 143: 130 M. Kayaalp et al. INSTRUCTION 1
Page 144 and 145: 132 M. Kayaalp et al. time. Alterna
Page 146 and 147: 134 M. Kayaalp et al. Fig. 3. Numbe
Page 148 and 149: 136 M. Kayaalp et al. The results o
Page 150 and 151: Efficient Transaction Nesting in Ha
Page 152 and 153:
140 Y. Liu et al. HTMs include TCC
Page 154 and 155:
142 Y. Liu et al. rollback T0 begin
Page 156 and 157:
144 Y. Liu et al. Processor core Pr
Page 158 and 159:
146 Y. Liu et al. 5.2 Results and A
Page 160 and 161:
148 Y. Liu et al. decreases, partia
Page 162 and 163:
Decentralized Energy-Management to
Page 164 and 165:
152 B. Becker et al. Furthermore, t
Page 166 and 167:
154 B. Becker et al. An optimizing
Page 168 and 169:
156 B. Becker et al. smart-home man
Page 170 and 171:
158 B. Becker et al. freedom like w
Page 172 and 173:
160 B. Becker et al. Power [W] 4500
Page 174 and 175:
EnergySaving Cluster Roll: Power Sa
Page 176 and 177:
164 M.F. Dolz et al. Themodulequeri
Page 178 and 179:
166 M.F. Dolz et al. This daemon al
Page 180 and 181:
168 M.F. Dolz et al. been submitted
Page 182 and 183:
170 M.F. Dolz et al. On the other h
Page 184 and 185:
172 M.F. Dolz et al. at the inactiv
Page 186 and 187:
Effect of the Degree of Neighborhoo
Page 188 and 189:
176 T. Abdullah et al. A zone based
Page 190 and 191:
178 T. Abdullah et al. A consumer/p
Page 192 and 193:
180 T. Abdullah et al. Messages 140
Page 194 and 195:
182 T. Abdullah et al. (except when
Page 196 and 197:
184 T. Abdullah et al. % Matchmakin
Page 198 and 199:
186 T. Abdullah et al. show that th
Page 200 and 201:
188 M. Schindewolf, D. Kramer, and
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
200 R. Plyaskin and A. Herkersdorf
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
Page 220 and 221:
Page 222 and 223:
Page 224 and 225:
212 M.Y. Qadri, D. Matichard, and K
Page 226 and 227:
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
A Tightly Coupled Accelerator Infra
Page 236 and 237:
224 F. Nowak and R. Buchty where A
Page 238 and 239:
226 F. Nowak and R. Buchty Fig. 3.
Page 240 and 241:
228 F. Nowak and R. Buchty Table 2.
Page 242 and 243:
230 F. Nowak and R. Buchty Table 4.
Page 244 and 245:
232 F. Nowak and R. Buchty 5.3 Comp
Page 246 and 247:
Optimizing Stencil Application on M
Page 248 and 249:
236 F. Xudong et al. compared to th
Page 250 and 251:
238 F. Xudong et al. stencil comput
Page 252 and 253:
240 F. Xudong et al. threads in the
Page 254 and 255:
242 F. Xudong et al. Speedup 14 12
Page 256 and 257:
244 F. Xudong et al. 5 Related Work
Page 258:
Abdullah, Tariq 174 Alima, Luc Onan
show all

Architecture of Computing Systems (Lecture Notes in Computer ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?