Learn More
The views and conclusions presented in this paper are those of the authors and do not represent the oocial policies, either expressed or implied, of ARPA, NSF, or the United States Government. Abstract EEciently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching(More)
Programming contests can provide a high-profile method for attracting interest in computer science. We describe our philosophy as it pertains to the purpose and merits of programming contests as well as their implementation. We believe that we have successfully combined the theoretical and practical aspects of computer science in an enjoyable contest in(More)
Efficiently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching shared data is the cost of keeping the multiple copies coherent. One source of unnecessary coherency overhead is caused by a problem known as false sharing. Unfortunately, the lack of a precise,(More)
On the evening of October 23, 1990, electronic mail messages started to pour into the computers at the Duke University Computer Science Department. Teams of programmers from all over the world were registering to compete in the rst global (as far as the authors are aware) programming contest to be held on the Internet. During the three-hour competition,(More)
In this paper we describe the addition of an access control list (ACL) extension and the installation of a Kerbeross1, 3] based authorization mechanism to the X11R4 MIT sample server. We assume some familiarity with the X Window System and with Kerberos network au-thentication. The access control list (ACL) extension provides a mechanism for maintaining a(More)
  • 1