Search
Now showing items 1-10 of 10
An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem.
(The Computer Journal, 1991-08)
A fast method for constructing efficient solutions for graphical mutual exclusion problems based on semaphores associated with processes is described. The number of semaphores used is equal to the number of processes in ...
Dining Philosophers Revisited, Again
(SIGCSE Bulletin, 1991-06)
This paper describes a problem in the solution of the dining philosophers problem by Gingras [2] that makes it inefficient, instead of the claimed maximal efficiency. A correct implementation is presented. Even then, the ...
A More General Model For Handling Missing Information In Relational DataBases Using A 3-Valued Logic
(SIGMOD Record, 1991-09)
Codd proposed the use of two interpretations of nulls to handle missing information in relational databases that may lead to a 4-valued logic [Codd86, Codd87]. In a more general model, three interpretations of nulls are ...
Teaching a graduate expert systems course
(SIGCSE Bulletin, 1990-12)
Because expert systems technology is relatively new, there are only a few papers describing a graduate course on the subject. Most of the described courses were either seminar oriented or centered around a student project, ...
Using CLIPS as the cornerstone of a graduate expert systems course
(Proceedings of the 2nd Annual CLIPS Users Conference, 1991-09)
The effective use of the C Language Integrated Production System (CLIPS) as a cornerstone in a graduate expert systems course is described. The course include 8 or 9 hours of in-depth lecturing in CLIPS, as well as a broad ...
An Ada Solution to the General Mutual Exclusion Problem
(Ada Letters, 1993)
Although some specific mutual exclusion problems have been studied extensively, automatic solutions to synchronize general mutual exclusion problems with arbitrary mutual exclusion constraints have not been fully explored. ...
Semaphores in Ada-94
(Ada Letters, 1994)
The new protected type and requeue features in Ada-94 make possible the efficient implementations of many concurrent solutions, previously not possible in Ada-83. In this paper, the implementations of various semaphore ...
Priority Ceiling Protocol in Ada
(Proceedings of the Tri-Ada '96 Conference, 1996-11)
The priority ceiling protocol (PCP) is an effective protocol for minimizing priority inversions in real-time scheduling. Priority inversion occurs when a high priority task is blocked by a low priority task, such as at a ...
An Optimal Algorithm For Reducing Edge-Solvable Mutual Exclusion Graphs
(The Computer Journal, 1994)
A mutual exclusion graph can be used to model a graphical mutual exclusion problem where a concurrent process is represented by a vertex and a mutual exclusion constraint between two processes is represented by an edge ...
An undergraduate Web-based database project
(J. Computing in Small Colleges, 1998-04)
Web technologies have become essential in the computing curricula. However, teaching a Web development course to computing students is challenging because of large bodies of knowledge, rapidly changing technologies, ...