Venice: Improving Solid-State Drive Parallelism at Low Cost via Conflict-Free Accesses
The performance and capacity of solid-state drives (SSDs) are continuously improving to
meet the increasing demands of modern data-intensive applications. Unfortunately …
meet the increasing demands of modern data-intensive applications. Unfortunately …
A general theory for deadlock-free adaptive routing using a mixed set of resources
J Duato, TM Pinkston - IEEE Transactions on Parallel and …, 2001 - ieeexplore.ieee.org
This paper presents a theoretical framework for the design of deadlock-free fully adaptive
routing algorithms for a general class of network topologies and switching techniques in a …
routing algorithms for a general class of network topologies and switching techniques in a …
Flexible and efficient routing based on progressive deadlock recovery
TM Pinkston - IEEE Transactions on Computers, 1999 - ieeexplore.ieee.org
The development of fully adaptive, cut-through (wormhole) networks is important for
achieving high performance in communication-critical parallel processor systems. Increased …
achieving high performance in communication-critical parallel processor systems. Increased …
Method for preventing buffer deadlock in dataflow computations
CW Stanfill, CA Lasser - US Patent 6,088,716, 2000 - Google Patents
A buffer deadlock prevention technique for dataflow computations. The invention that
implements the following algorithm:(1) providing a supplemental buffer for each input of a" …
implements the following algorithm:(1) providing a supplemental buffer for each input of a" …
A formal model of message blocking and deadlock resolution in interconnection networks
S Wamakulasuriya, TM Pinkston - IEEE Transactions on …, 2000 - ieeexplore.ieee.org
This paper presents a theoretical model of resource allocations and dependencies in
wormhole and virtual cut-through interconnection networks. This model allows various types …
wormhole and virtual cut-through interconnection networks. This model allows various types …
[PDF][PDF] Dynamic Reconfiguration in High-Speed Computer Clusters.
DR Avresky, NH Natchev, V Shurbanov - cluster, 2001 - Citeseer
High-speed local and system area networks may change their topology due to switching
on/off of routers and hosts or due to component failur es. In such cases, a reconfiguration …
on/off of routers and hosts or due to component failur es. In such cases, a reconfiguration …
Local livelock analysis of component-based models
In previous work we have proposed a correct-by-construction approach for building
deadlock-free CSP models. It contains a comprehensive set of composition rules that …
deadlock-free CSP models. It contains a comprehensive set of composition rules that …
Deadlock characterization and resolution in interconnection networks
T Pinkston - Deadlock Resolution in Computer-Integrated …, 2004 - taylorfrancis.com
Because network resources are finite and, ultimately, are contended for, structural hazards
on those resources are inevitable which delay or prevent packettransmission in the network …
on those resources are inevitable which delay or prevent packettransmission in the network …
Virtual cut-through implementation of the HB packet switching routing algorithm
P Palazari, M Coli - … of the Sixth Euromicro Workshop on …, 1998 - ieeexplore.ieee.org
In the last years, since the early 80's, wormhole and virtual cut through routing modalities
have replaced packet switching and circuit switching schemes. We give the theoretical …
have replaced packet switching and circuit switching schemes. We give the theoretical …