Skip to main content
Article thumbnail
Location of Repository

On Efficient Distributed Deadlock Avoidance for Real-time and Embedded Systems

By Henny B. Sipma, Zohar Manna, Venkita Subramonian and Christopher Gill

Abstract

Abstract Thread allocation is an important problem in dis-tributed real-time and embedded (DRE) systems. A too liberal thread allocation policy may cause deadlock, atoo conservative policy limits potential parallelism, thus wasting resources. However, achieving (global) optimalthread utilization, while avoiding deadlock, has been proven impractical in distributed systems: it requirestoo much communication between components. In previous work we showed that efficient local threadallocation protocols are possible if the protocols are parameterized by global static data, in particular, an an-notation of the global call graph of all tasks to be performed by the system. We proved that absence of cyclicdependencies in this annotation guarantees absence of deadlock. In this paper we present an algorithm to computeoptimal annotations, that is annotations that maximiz

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.6693
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://theory.stanford.edu/~si... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.