Sciweavers

3360 search results - page 233 / 672
» Opportunistic Data Structures with Applications
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
An approach to locality-conscious load balancing and transparent memory hierarchy management with a global-address-space paralle
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
FPL
2009
Springer
135views Hardware» more  FPL 2009»
15 years 9 months ago
Fast critical sections via thread scheduling for FPGA-based multithreaded processors
As FPGA-based systems including soft processors become increasingly common, we are motivated to better understand the architectural trade-offs and improve the efficiency of these...
Martin Labrecque, J. Gregory Steffan
SAC
2004
ACM
15 years 10 months ago
Self-maintained distributed tuples for field-based coordination in dynamic networks
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...
Marco Mamei, Franco Zambonelli
VLSID
1999
IEEE
97views VLSI» more  VLSID 1999»
15 years 8 months ago
Improving Area Efficiency of Residue Number System based Implementation of DSP Algorithms
Residue Number System based applications involve modulo-arithmetic which is typically implemented using look-up-tables (LUTs) for a small value of modulus. In this paper, we prese...
M. N. Mahesh, Satrajit Gupta, Mahesh Mehendale
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 10 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi