Communications of the ACM, vol. 21,no. 7,1978
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally ...
Communications of the ACM, vol. 13,no. 6,1970
Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at ...
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger
Communications of the ACM, vol. 19,no. 11,1976
In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a ...
Communications of the ACM, vol. 23,no. 6,1980
To accurately render a two-dimensional image of a three-dimensional scene, global illumination information that affects the intensity of each pixel of the image must be known at the time the intensity is calculated. In a simplified form, this ...
Communications of the ACM, vol. 15,no. 12,1972
This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a “modularization” is dependent upon the criteria used ...
Communications of the ACM, vol. 21,no. 8,1978
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded ...
Communications of the ACM, vol. 18,no. 9,1975
This paper develops the multidimensional binary search tree (or k-d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k-d tree is defined and examples ...
Ronald L. Rivest, Adi Shamir, Len Adleman
Communications of the ACM, vol. 21,no. 2,1978
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to ...
Communications of the ACM, vol. 33,no. 10,1990
Parallel discrete event simulation (PDES), sometimes called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. ...
Communications of the ACM, vol. 26,no. 6,1983
In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage ...