| |
 |
|
|
Speegle, Greg
Baylor University
Waco, Texas
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 12
reviews
|
|
|
|
|
|
|
|
Structured and object-oriented techniques (2nd ed.)
Andrew C. J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1997. Type: Book (9780134887364)
Instructors of introductory courses using C++ must make the difficult decision of when to introduce object-oriented concepts. This text for a first-year course introduces object-oriented concepts from the very beginning. Chapter 2 is t...
|
Dec 1 1997 |
|
|
|
|
|
|
BOOKTWO of object-oriented knowledge: the working object
Henderson-Sellers B. (ed), Edwards J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1994. Type: Book (9780130939807)
Henderson-Sellers and Edwards’s book reads like a Ph.D. dissertation. It contains a novel new idea, the MOSES software engineering paradigm, and many references showing how the novel idea fits into existing work. It even cont...
|
Aug 1 1995 |
|
|
|
|
|
|
The design of a system for distributing shared objects
Dollimore J., Miranda E., Xu W. The Computer Journal 34(6): 514-521, 1991. Type: Article
The authors have significantly extended the Smalltalk language to create a distributed system. The system contains transparent access to distributed objects, shared objects, authorization and concurrency control, and persistent objects...
|
Jan 1 1993 |
|
|
|
|
|
|
Conflict detection tradeoffs for replicated data
Carey M., Livny M. ACM Transactions on Database Systems 16(4): 703-746, 1991. Type: Article
A simulation analysis is presented for five concurrency control protocols--two-phase locking, optimistic, basic timestamps, wound-wait, and optimistic two-phase locking--operating with replicated data. Each protocol i...
|
Aug 1 1992 |
|
|
|
|
|
|
Optimizing equijoin queries in distributed databases where relations are hash partitioned
Shasha D., Wang T. ACM Transactions on Database Systems 16(2): 279-308, 1991. Type: Article
The initial premise of this paper, supported by other work, is that repartitioning a hash partitioned database dominates query processing time and that the goal for distributed query optimization should be reducing these repartitions. ...
|
Jun 1 1992 |
|
|
|
|
|
|
Dynamic voting algorithms for maintaining the consistency of a replicated database
Jajodia S. (ed), Mutchler D. ACM Transactions on Database Systems 15(2): 230-280, 1990. Type: Article
Dynamic algorithms can be used to manage replicated data in distributed databases. In dynamic voting, an update to a data item is allowed if the site that receives the update request is part of a partition that contains more than half ...
|
Feb 1 1991 |
|
|
|
|
|
|
The Raid Distributed Database System
Bhargava B., Riedl J. IEEE Transactions on Software Engineering 15(6): 726-736, 1989. Type: Article
Bhargava and Riedl describe an implementation of a distributed database system. Unlike other implementations, Raid is designed to allow experimentation with the different aspects of a distributed system in order to determine which feat...
|
Jul 1 1990 |
|
|
|
|
|
|
MAP/TOP networking: a foundation for computer-integrated manufacturing
Jones V., McGraw-Hill, Inc., New York, NY, 1987. Type: Book (9780070328068)
MAP/TOP networking: achieving computer-integrated manufacturing provides an excellent introduction to the problem of integrating computer systems from many different vendors. The book describes one possible solution in detail (t...
|
Feb 1 1989 |
|
|
|
|
|
|
Reaching approximate agreement in the presence of faults
Dolev D., Lynch N., Pinter S., Stark E., Weihl W. Journal of the ACM 33(3): 499-516, 1986. Type: Article
The Byzantine generals problem is one of the most famous problems in computer science. The problem is for processes to reach agreement on some value despite the malicious effects of faulty processes. This paper presents a solution for ...
|
Aug 1 1988 |
|
|
|
|
|
|
On the minimal synchronism needed for distributed consensus
Dolev D., Dwork C., Stockmeyer L. Journal of the ACM 34(1): 77-97, 1987. Type: Article
Reaching agreement in the presence of failures by a distributed system is an interesting problem. This paper defines the conditions that are sufficient for agreement to occur and some conditions that make agreement impossible. The pape...
|
Aug 1 1987 |
|
|
|
|
|
| |
|
|
| |
|
|
