Sciweavers

1675 search results - page 133 / 335
» Implementing Data Cubes Efficiently
Sort
View
ICPADS
2010
IEEE
13 years 8 months ago
Data-Aware Task Scheduling on Multi-accelerator Based Platforms
To fully tap into the potential of heterogeneous machines composed of multicore processors and multiple accelerators, simple offloading approaches in which the main trunk of the ap...
Cédric Augonnet, Jérôme Clet-O...
FPGA
1999
ACM
174views FPGA» more  FPGA 1999»
14 years 2 months ago
Reduction of Latency and Resource Usage in Bit-Level Pipelined Data Paths for FPGAs
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
Peter Kollig, Bashir M. Al-Hashimi
JWSR
2007
172views more  JWSR 2007»
13 years 10 months ago
Service Class Driven Dynamic Data Source Discovery with DynaBot
: Dynamic Web data sources – sometimes known collectively as the Deep Web – increase the utility of the Web by providing intuitive access to data repositories anywhere that Web...
Daniel Rocco, James Caverlee, Ling Liu, Terence Cr...
ASPLOS
2008
ACM
14 years 4 days ago
No "power" struggles: coordinated multi-level power management for the data center
Power delivery, electricity consumption, and heat management are becoming key challenges in data center environments. Several past solutions have individually evaluated different ...
Ramya Raghavendra, Parthasarathy Ranganathan, Vani...
PC
2006
103views Management» more  PC 2006»
13 years 10 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi