✦ LIBER ✦

A deadlock-free communication kernel for loop architecture

✍ Scribed by P. Pramanik; P.K. Das; A.K. Bandyopadhyay; D.Q.M. Fay

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 626 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90239-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed algorithm for communication

Distributed algorithm for communication deadlock detection

✍ P Rontogiannis; G Pavlides; A Levy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 534 KB

A communication micro-kernel for impleme

A communication micro-kernel for implementing object-oriented programming on closely coupled distributed architectures

✍ Armano, Giuliano; Corradi, Antonio; Filippi, Valeria 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Within the framework of distributed object-oriented programming, this paper illustrates the main features of a communication micro-kernel able to perform, in a transparent way, both local and remote communications among objects located on a network of closely coupled microcomputers. The communicatio

A Necessary and Sufficient Condition for

A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing

✍ Loren Schwiebert; D.N. Jayasimha 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 341 KB

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that

A Generic Design Methodology for Deadloc

A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks

✍ Hyunmin Park; Dharma P. Agrawal 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 372 KB

This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-d

A Communication Architecture for a Massi

A Communication Architecture for a Massively Parallel Message-Passing Multicomputer

✍ C. Germain; J.L. Bechennec; D. Etiemble; J.P. Sansonnet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 916 KB

Communication networks stress the distinction between classical and massively parallel architectures. The network is the key for the whole architecture efficiency, while severe technological constraints limit the possible choices. This paper presents forced routing, which is the routing strategy of

Logarithmic Sobolev Inequality on Free L

Logarithmic Sobolev Inequality on Free Loop Groups for Heat Kernel Measures Associated with the General Sobolev Spaces

✍ Yuzuru Inahama 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 286 KB

In this paper we will prove the logarithmic Sobolev inequality on free loop groups for various heat kernel measures which P. Malliavin (1989Malliavin ( , 1991, in ``Diffusion Process and Related Problems in Analysis (M. A. Pinsley, Ed.), Vol. I, Birkha user, Basel) constructed. Those measures are as