| |
 |
|
|
Li, Keqin
State University of New York
New Paltz, New York
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 7 of 7
reviews
|
|
|
|
|
|
|
|
Parallel and distributed computing handbook
Zomaya A., McGraw-Hill, Inc., New York, NY, 1996. Type: Book (9780070730205)
The last three decades have witnessed significant progress in the theory and practice of parallel and distributed computing (PDC). There is no doubt that PDC has been one of the most active and productive research fields in computer sc...
|
Dec 1 1996 |
|
|
|
|
|
|
Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies
Chiang S., Mansharamani R., Vernon M. ACM SIGMETRICS Performance Evaluation Review 22(1): 33-44, 1994. Type: Article
The performance of non-preemptive scheduling policies in multiprogrammed parallel processing systems is investigated. A large body of literature in this field already exists. Through discrete event simulation, the authors provide some ...
|
Dec 1 1995 |
|
|
|
|
|
|
Are wait-free algorithms fast?
Attiya H., Lynch N., Shavit N. Journal of the ACM 41(4): 725-763, 1994. Type: Article
In shared-memory distributed systems, asynchronous processes operate at different speeds, with possible failures. A wait-free algorithm guarantees that each nonfaulty process terminates, regardless of the speeds and failures of other p...
|
Nov 1 1995 |
|
|
|
|
|
|
Intelligent scheduling
Zweben M., Fox M., Morgan Kaufmann Publishers Inc., San Francisco, CA, 1994. Type: Book (9781558602601)
Scheduling problems have been studied in the field of operations research (OR) for decades. Although substantial progress has been made in developing methods and algorithms to solve various scheduling problems, efforts to apply this th...
|
Aug 1 1995 |
|
|
|
|
|
|
Massively parallel methods for engineering and science problems
Camp W., Plimpton S., Hendrickson B., Leland R. Communications of the ACM 37(4): 30-41, 1994. Type: Article
The motivation of the special section of CACM on “High Performance Computing--Grand Challenges in Simulation,” edited by Adrian M. Tentner, is to encourage the development of high-performance computi...
|
Mar 1 1995 |
|
|
|
|
|
|
An NC algorithm for scheduling unit-time jobs with arbitrary release times and deadlines
Frederickson G. (ed), Rodger S. SIAM Journal on Computing 23(1): 185-211, 1994. Type: Article
The scheduling of unit-time jobs with arbitrary real-valued release times and deadlines on a single processor is addressed. The authors develop a parallel algorithm that, given a set of jobs, generates a feasible schedule or claims tha...
|
Jan 1 1995 |
|
|
|
|
|
|
Fishspear: a priority queue algorithm
Fischer M., Paterson M. (ed) Journal of the ACM 41(1): 3-30, 1994. Type: Article
Fishspear is a novel technique for implementing the priority queue abstract data type. The Fishspear data structure is a collection of sorted lists called “shaft” and “barbs,” which are organized...
|
Dec 1 1994 |
|
|
|
|
|
| |
|
|
| |
|
|
