Sciweavers

4171 search results - page 84 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
ICCAD
1995
IEEE
144views Hardware» more  ICCAD 1995»
15 years 6 months ago
Background memory management for dynamic data structure intensive processing systems
Abstract -- Telecommunication network management applications often require application-specific ICs that use large dynamically allocated stored data structures. Currently availab...
Gjalt G. de Jong, Bill Lin, Carl Verdonck, Sven Wu...
IPTPS
2005
Springer
15 years 8 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
CLUSTER
2009
IEEE
15 years 23 days ago
MITHRA: Multiple data independent tasks on a heterogeneous resource architecture
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...
Reza Farivar, Abhishek Verma, Ellick Chan, Roy H. ...
CLUSTER
2009
IEEE
15 years 9 months ago
Granules: A lightweight, streaming runtime for cloud computing with support, for Map-Reduce
— Cloud computing has gained significant traction in recent years. The Map-Reduce framework is currently the most dominant programming model in cloud computing settings. In this ...
Shrideep Pallickara, Jaliya Ekanayake, Geoffrey Fo...
IPPS
2007
IEEE
15 years 9 months ago
Pipelining Tradeoffs of Massively Parallel SuperCISC Hardware Functions
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, ano...
Colin J. Ihrig, Justin Stander, Alex K. Jones