|
|
|
|
Wu, Jie
Florida Atlantic University
Boca Raton, Florida
|
|
|
|
|
|
|
|
Date Reviewed |
|
|
1 - 7 of 7
reviews
|
|
|
|
|
|
|
|
Flexible and Efficient Routing Based on Progressive Deadlock Recovery Pinkston T. IEEE Transactions on Computers 48(7): 649-669, 1999. Type: Article
The idea behind this paper and much of Pinkston’s other work is that the best way to handle deadlocks in routing is to use deadlock recovery. Deadlock recovery routing is premised on the notion that deadlocks are rare....
|
Apr 1 2000 |
|
|
|
|
|
|
Designing Tree-Based Barrier Synchronization on 2D Mesh Networks Yang J., King C. IEEE Transactions on Parallel and Distributed Systems 9(6): 526-534, 1998. Type: Article
The authors point out the shortcomings of path-based routing schemes for barrier synchronization. They then put forward a tree-based scheme that skirts these problems. There are two major tasks in the proposed scheme: establishing a co...
|
Feb 1 1999 |
|
|
|
|
|
|
Embedding Hierarchical Hypercube Networks into the Hypercube Hamdi M., Song S. IEEE Transactions on Parallel and Distributed Systems 8(9): 897-902, 1997. Type: Article
The hypercube is an efficient interconnection network for parallel processing, and it can efficiently embed many other parallel processing architectures. It has been proven that hierarchical hypercube networks are cost-effective for a ...
|
Nov 1 1998 |
|
|
|
|
|
|
Hierarchical interconnection structures for field programmable gate arrays Lai Y., Wang P. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 5(2): 186-196, 1997. Type: Article
The major problem with array field programmable gate arrays (FPGAs) is that their density and performance are lower than those of conventional gate arrays. To improve this, the authors present a new FPGA architecture, the FPGA with hie...
|
Feb 1 1998 |
|
|
|
|
|
|
A hybrid distributed mutual exclusion algorithm Chang Y. Microprocessing and Microprogramming 41(10): 715-731, 1996. Type: Article
The existing mutual exclusion algorithms in distributed systems can be categorized as token-based or non-token-based. Some of these algorithms focus on reducing message traffic, others on minimizing time delay. However, there is no sin...
|
Oct 1 1997 |
|
|
|
|
|
|
A bounded first-in, first-enabled solution to the l-exclusion problem Afek Y., Dolev D., Gafni E., Merritt M., Shavit N. ACM Transactions on Programming Languages and Systems 16(3): 939-953, 1994. Type: Article
Consider a system consisting of n processes, where each process has a segment of code called a critical section. The important feature of the system is that, when one process is executing in its critical section, no ...
|
Oct 1 1995 |
|
|
|
|
|
|
Network programming in C Nance B., Que Corp., Indianapolis, IN, 1990. Type: Book (9780880225694)
Both novices and advanced programmers will find this book useful. It does not teach the C language, but for a person with a fair understanding of C it provides substantial information on network programming at the application and the d...
|
Oct 1 1991 |
|
|
|
|
|
|
|
|
|
|
|