Searching for authors named "James Burns" – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
Mutual Exclusion Using Invisible Reads and Writes
- …The shared space (the number of distinct values taken on by the set of shared variables) requirements of Dijkstra's original mutual exclusion problem are examined. It is shown that 2 shared states are necessary and sufficient to solve the problem of deadlock-free mutual exclusion for N processes usi…
- Add To MetaCart
-
Two Complementary Course Sequences on the Design and Implementation of Software Products
- …For many students, the first chance to produce software as part of a team comes with the first work experience outside a university. The difficulties of working with others are compounded by the problems of working in a new environment and for a client with ambiguous and changing goals. Although it …
- Cited by 3 (1 self) – Add To MetaCart
-
Area and System Clock Effects on SMT/CMP Processors
- …Two approaches to high throughput processors are Chip Multi-Processing (CMP) and Simultaneous MultiThreading (SMT). CMP increases layout efficiency, which allows more functional units and a faster clock rate. However, CMP suffers from hardware partitioning of functional resources. SMT increases func…
- Add To MetaCart
-
The Byzantine Firing Squad Problem
- …A new problem, theJ3xqntin_o. fi_ri_ng s._cl_93_d_2_rob9_, is defined and solved in two versions, permissive and strict. Both problems provide for synchronization of n initially unsynchronized processors in a synchronous network, in the absence of a common clock and in the presence of a limited numb…
- Cited by 8 (2 self) – Add To MetaCart
-
Bounds on Shared Memory for Mutual Exclusion
- …this paper appeared in the 18th Annual Allerton Conference on Communication, Control, and Computing. October 1980. The research was supported in part by Army Research Office Contract DAAG29-79-C~0155, NSF Grants MCS77-15628, MCS78-01689, CCR-8611442, and CCR-8915206, DARPA Grants N00014-83-K-0125 an…
- Cited by 41 (0 self) – Add To MetaCart
-
Causal Memory: Definitions, Implementation and Programming
- …The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to larg…
- Cited by 62 (8 self) – Add To MetaCart
-
An Improved Leader Election Protocol in Multi-hop Radio Networks
- …This paper presents two randomized protocols for the problem of electing a "leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. [BGI87] is presented, in which the termination problem is addressed. Then, an effi…
- Cited by 2 (0 self) – Add To MetaCart
-
Multilayered Mobility Management for Survivable Network
- …A variety of mobility management scheme have been developed for commercial networks ranging from Mobile IP (network layer support), to the Session Initiation Protocol (SIP) based on application layer support such as DNS and SMTP, and Micro-Mobility approaches like Cellular IP, HAWAII. There are sign…
- Add To MetaCart
-
THE BY;ANINE FIRING SQUAD PROBLEI
- …I.3 [Programming hnlqn]: Concmrent Programming; D.4.1 [Opratin$ Systems]: Process Managementsol- tio.4 D.4.5 [Opalln$ Systems]: Reliabilityult tol; D.4.7 [Operatin Systems]: Organization and Designditibtged General Terms: Reliability Additional Key Words and Phrases: Agreement, Byzantine Generals …
- Add To MetaCart
-
Realization of integrated mobility management protocol for ad hoc networks
- …A multi-layer mobility management architecture has been designed to take care of real-time and non-real-time traffic for intra-domain and inter-domain mobility in a survivable network. It consists of three components based on functionality. SIP based mobility management is used for real-time communi…
- Cited by 3 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
