[PDF] Top 20 SRC RR 7 pdf

... Thus, the minimum sequence of memory accesses in the absence of contention that a mutual exclusion algorithm must perform is: w-x, r-y, w-y, r-x, critical section, w-y.. This is the sequ[r] ... See full document

... Theorem 7 The algorithm stConn runs in time O . m 2 log 5 n = p / using space O . p / . Proof: Choosing a random set of p vertices according to the stationary distribution can be done in O . m / steps using O . p ... See full document

... In this paper, we describe a range of public-key smart-card authentica- tion protocols, with dierent compromises between cost and security. The protocols were developed in the context of the Digital Distributed System ... See full document

... Here is the animation algorithm used by the Plaid program: visualize a ball rolling on a billiard table at constant speed, bouncing when it hits the rails. A rectangle continuously expands and contracts so that it is ... See full document

... Our study is intended as a formal basis for parts of a security architecture, and for the Digital Distributed Systems Security Architecture (DSSA) in particular [11]; this architecture is currently under implementation. ... See full document

... By t 2 →t n+2 |p i [t 2 ...t n+1 ] we denote t 2 →t n+2 if p i 7 t, and p i [t 2 ...t n+1 ] otherwise. Analogously, t 2 →t n+2 |q j [t n+2 ...t n+m+1 ] denotes t 2 →t n+2 if q j 7 t, and q j [t n+2 ...t ... See full document

... Most existing general-purpose operating systems provide rich collections of tools and applications, but lack the support for fine-grain concurrency that would ease the construction of applications dealing with asynchrony ... See full document

... Some work on replication has deliberately chosen looser replication se- mantics, accepting forms of consistency between replicas that are weaker than one-copy serializability, in order to achieve higher availability ... See full document

... The Owicki-Gries method, an extension to concurrent programs of Floyd’s method [3] for proving partial correctness of sequential programs, was developed independently by Owicki and Gries [11] and by us [8]. These two ... See full document

... les. It is tempting to consider integrating the DF les with the le sys- tem directories to provide a single naming mechanism. One approach to this consolidation would be starting with le servers that named les with ... See full document

... [6] R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz and C. Racko, \Random walks, universal traversal sequences, and the complexity of maze problems," Proceedings of the 20th IEEE Symposium on Foundations of Computer ... See full document

... To restrict attention to the computations that start from the expected initial states, we de ne the predicate Init: Init = lS ^ lR A computation satis es Init ^ 2[N ] if it is a computat[r] ... See full document

... Within a network of interactive, multiaccess computer systems, on the other hand, a person at one node will have access to programs running at other nodes, even though those programs wer[r] ... See full document

... Our approach to both hardware and software research is to create and use real systems so that we can investigate their properties fully. Complex systems cannot be evaluated solely in the abstract. Based on this belief, ... See full document

... SRC also performs work of a more mathematical flavor which complements our systems research. Some of this work is in established fields of theoretical computer science, such as the analysis of algorithms, ... See full document

... SRC began recruiting its rst research scientists in l984|their charter, to advance the state of knowledge in all aspects of computer systems research. Our current work includes exploring high-performance personal ... See full document

... We are beginning to accumulate operational experience with Autonet. Our initial experience confirms that the goal of largely automatic operation of a network using arbitrary topology and active switches is realistic. ... See full document

... DEC's business and technology objectives require a strong research program. The Systems Research Center (SRC) and three other research laboratories are committed to filling that need. SRC began recruiting ... See full document

... SRC began recruiting its rst research scientists in l984|their charter, to advance the state of knowledge in all aspects of computer systems research. Our current work includes exploring high-performance personal ... See full document

... imports employee; constant int eref_maxPrintSize = employee_maxPrintSize + 27; abstract type employee ref eref; uses sprinteref, char[]; int eref_sprintchar s[], eref er { requires maxIn[r] ... See full document