| |
 |
|
|
Gelenbe, Erol
Duke University
Durham, North Carolina
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 3 of 3
reviews
|
|
|
|
|
|
|
|
Memory-constrained task scheduling on a network of dual processors
Fuchs K., Kafura D. Journal of the ACM 32(1): 102-129, 1985. Type: Article
This paper is a fundamental contribution to the theory of computer task scheduling. A new approach to such problems is taken by considering that processors and memory must be simultaneously allocated to achieve computing. Thus, the aut...
|
Jun 1 1986 |
|
|
|
|
|
|
A method for equijoin queries in distributed relational databases
Cheung T. (ed) IEEE Transactions on Computers 31(9): 746-751, 1982. Type: Article
The problem considered is to design an effective and efficient procedure for processing queries concerning distributed relations. The major cost function considered is related to the transmission time for the relations. The approach is...
|
May 1 1985 |
|
|
|
|
|
|
On the optimum checkpoint selection problem
Toueg S., Babaoglu O. SIAM Journal on Computing 13(3): 630-649, 1984. Type: Article
This work considers a sequential program, subject to failures, in which checkpoints may be installed in each of the well-defined program steps at given cost. Recovery, in case of failure, is made with respect to the closest preceding ...
|
Mar 1 1985 |
|
|
|
|
|
| |
|
|
| |
|
|
