Sciweavers

1221 search results - page 126 / 245
» Balanced graph partitioning
Sort
View
HPCA
2000
IEEE
14 years 2 months ago
Dynamic Cluster Assignment Mechanisms
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster mic...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
DAWAK
2008
Springer
13 years 12 months ago
Efficient Data Distribution for DWS
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
Raquel Almeida, Jorge Vieira, Marco Vieira, Henriq...
INFOCOM
2011
IEEE
13 years 1 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...
RELMICS
2005
Springer
14 years 3 months ago
Control-Flow Semantics for Assembly-Level Data-Flow Graphs
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...
Wolfram Kahl, Christopher Kumar Anand, Jacques Car...
ISLPED
2003
ACM
82views Hardware» more  ISLPED 2003»
14 years 3 months ago
Multivoltage scheduling with voltage-partitioned variable storage
Multivoltage scheduling (MVS) for datapaths offers the energy savings of voltage scaling on a per-operation basis with a voltage aware operator scheduling. This work investigates...
Amitabh Menon, S. K. Nandy, Mahesh Mehendale