| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 41
reviews
|
|
|
 |
|
|
|
|
Task Allocation on a Network of Processors
Hsu T., Lee J., Lopez D., Royce W. IEEE Transactions on Computers 49(12): 1339-1353, 2000. Type: Article
One of the most important problems in distributed computing is thescheduling of tasks for a network of computing nodes. Many theoreticaland experimental studies have been done to account for communicationdelays, bandwidth requirement, ...
|
Sep 1 2001 |
|
|
|
|
|
|
Undirected single-source shortest paths with positive integer weights in linear time
Thorup M. Journal of the ACM 46(3): 362-394, 1999. Type: Article
One of the best-known problems in classical graph theory is the single-source shortest path problem for a graph whose edges are assigned nonnegative weights. An elegant solution of this problem was provided by Dijkstra in the late 1950...
|
Nov 1 1999 |
|
|
|
|
|
|
Semi on-line scheduling on two identical machines
He Y., Zhang G. Computing 62(3): 179-187, 1999. Type: Article
Online scheduling of independent jobs on multiple uniform machines with an objective of minimizing the makespan is a classical problem. Classical list scheduling (LS) is the overall best heuristic algorithm known. Recently, people have...
|
Oct 1 1999 |
|
|
|
|
|
|
Labelled trees and pairs of input-output permutations in priority queues
Golin M., Zaks S. Theoretical Computer Science 205(1-2): 99-114, 1998. Type: Article
An allowable pair of permutations of n distinct elements is defined to be a pair where thesecond permutation can be obtained from the first by a priority-queueoperation (a valid sequence of pushand delete-m...
|
Jul 1 1999 |
|
|
|
|
|
|
Distributed and parallel computing
El-Rewini H., Lewis T. (ed), Manning Publications Co., Greenwich, CT, 1998. Type: Book (9780137955923)
Distributed and parallel computing has experienced massive growth in the last few years. On-site credit card validation, integrated airline reservation systems, a worldwide automatic teller machine network, the Internet email system, a...
|
Mar 1 1999 |
|
|
|
|
|
|
Strictly-upward drawings of ordered search trees
Crescenzi P., Penna P. Theoretical Computer Science 203(1): 51-67, 1998. Type: Article
Efficient drawing of graphs is important for many real-life applications, since a visual representation often leads to a better understanding of the information structure. The general problem involves drawing a graph simply (in a reada...
|
Mar 1 1999 |
|
|
|
|
|
|
An on-line algorithm for some uniform processor scheduling
Li R., Shi L. SIAM Journal on Computing 27(2): 414-422, 1998. Type: Article
Online scheduling of independent jobs on multiple uniform machines, with the objective of minimizing the makespan, is an ancient problem; the lower bounds are well known, and list scheduling (LS) was the best known heuristic algorithm....
|
Nov 1 1998 |
|
|
|
|
|
|
A comparative study of parallel and sequential priority queue algorithms
Rönngren R., Ayani R. ACM Transactions on Modeling and Computer Simulation 7(2): 157-209, 1997. Type: Article
The priority queue is an important data structure that is essential to the design of many system programs, such as operating systems, as well as to the design of many applications, such as simulations. In fact, priority queues must be ...
|
Nov 1 1997 |
|
|
|
|
|
|
Trapping mutual exclusion in the box calculus
Esparza J., Bruns G. Theoretical Computer Science 153(1-2): 95-128, 1996. Type: Article
Box calculus is a new process algebra that seems to have a relatively simple Petri net semantics. The purpose of this new algebra is to be able to translate real-life parallel programs into a set of algebraic rules and then to prove in...
|
Jul 1 1997 |
|
|
|
|
|
|
A comprehensive study of the complexity of multiparty interaction
Joung Y., Smolka S. Journal of the ACM 43(1): 75-115, 1996. Type: Article
In designing distributed systems, protocols and language primitives are needed to implement different synchronization requirements, among other things. Multiparty interaction is a relatively recent concept of a set of I/O operations to...
|
Jun 1 1997 |
|
|
|
|
|
| |
|
|
| |
|
|
