| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 36
reviews
|
|
|
 |
|
|
|
|
Architecture-independent parallelism for both shared- and distributed-memory machines using the Filaments package
Lowenthal D., Freeh V. Parallel Computing 26(10): 1297-1323, 2000. Type: Article
The Filaments package is a software kernel that supports efficient execution of fine-grain parallelism and shared-variable communication on both shared- and distributed-memory machines. Each filament is a very lightweight thread that r...
|
Feb 1 2002 |
|
|
|
|
|
|
Soft timers: efficient microsecond software timer support for network processing
Aron M., Druschel P. ACM Transactions on Computer Systems 18(3): 197-228, 2000. Type: Article
As chips become more complex, the cost of a context switch becomes relatively more expensive, since there is more context to save. As network speeds increase while packet size remains constant, the number of interrupts generated by a n...
|
Jun 1 2001 |
|
|
|
|
|
|
Understanding operating systems (3rd ed.)
Flynn I., McHoes A., Brooks/Cole Publishing Co., Pacific Grove, CA, 2001. 462 pp. Type: Book (9780534376666)
The 11 chapters of Part 1 of this book, intended as an introduction to operating systems for anyone who uses a computer, provide a background in the theory of operating systems. The five chapters of Part 2 examine examples of current o...
|
Feb 1 2001 |
|
|
|
|
|
|
Local type inference
Pierce B., Turner D. ACM Transactions on Programming Languages and Systems 22(1): 1-44, 2000. Type: Article, Reviews: (1 of 2)
Languages that support polymorphism are a convenience to the programmer. The convenience comes at a price, however, in the form of extra complexity in the compiler to infer the actual types when a polymorphic function is referenced. Mu...
|
Jul 1 2000 |
|
|
|
|
|
|
Local type inference
Pierce B., Turner D. ACM Transactions on Programming Languages and Systems 22(1): 1-44, 2000. Type: Article, Reviews: (2 of 2)
Languages that support polymorphism are a convenience to theprogrammer. The convenience comes at a price, however, inthe form of extra complexity in the compiler to infer the actual typeswhen a polymorphic function is referenced. Much ...
|
Jul 1 2000 |
|
|
|
|
|
|
Dynamic trees and dynamic point location
Goodrich M., Tamassia R. SIAM Journal on Computing 28(2): 612-636, 1998. Type: Article
Computational geometry is one of the newer branches of computerscience and it has already contributed greatly to the field, not only inthe problems it has given us, but also in new data structures designedfor these problems that have f...
|
Jun 1 1999 |
|
|
|
|
|
|
Complexity analysis of a parallel lattice basis reduction algorithm
Heckler C., Thiele L. SIAM Journal on Computing 27(5): 1295-1302, 1998. Type: Article
Lattice basis reduction, the problem of finding a basis with short vectors for a lattice, has applications in several areas. The best known sequential algorithm for this problem is O ( n4logB )
|
Apr 1 1999 |
|
|
|
|
|
|
Fault-tolerant computation in the full information model
Goldreich O., Goldwasser S. (ed), Linial N. SIAM Journal on Computing 27(2): 506-544, 1998. Type: Article
Suppose m players are interested in globally computing v = f ( x1 ,..., xm ) , where f is a predetermined function of m variables and
|
Nov 1 1998 |
|
|
|
|
|
|
k-Arbiter
Manabe Y., Baldoni R., Raynal M. (ed), Aoyagi S. Theoretical Computer Science 193(1-2): 97-112, 1998. Type: Article
The mutual exclusion problem has provided a rich field of research for computer scientists. The problem is easy to state, has real-world application in operating systems, and generalizes in a variety of interesting ways depending on th...
|
Nov 1 1998 |
|
|
|
|
|
|
Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading
Lo J., Emer J., Levy H., Stamm R., Tullsen D., Eggers S. ACM Transactions on Computer Systems 15(3): 322-354, 1997. Type: Article
One of the highest compliments that an idea can be given is for others to ask, “Why didn’t I think of that?” As the push toward faster and faster computers relies increasingly on making use of the various ...
|
Aug 1 1998 |
|
|
|
|
|
| |
|
|
| |
|
|
