Geneva G. Belford

Learn More
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem, it involves matching a set of candidate reviewers with a paper or proposal to be reviewed. A common deficiency of all existing work on solving this problem is that they do not(More)
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers, but the case for a distributed database system (DDBS) has not been(More)
Each transaction in a real-time database system is associated with a timing constraint in the form of a deadline. Eficient transaction scheduling algorithms are required to minimize the number of missed transaction deadlines. In this paper, a performance evaluation model is provided to enable distributed real-time database system designers to analyte(More)
The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or near-optimal, solutions are therefore much needed. In this paper we present three theorems which can be applied a priori(More)
Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet. Scientific applications that stream multimedia include remote computational steering of visualization data and video-on-demand teleconferencing over the Access Grid. However , UDP does not possess a self-regulating, congestion-control mechanism; and(More)