Sciweavers

12 search results - page 1 / 3
» Optimizing Reaching Definitions Overhead in Queue Processors
Sort
View
JCIT
2007
63views more  JCIT 2007»
13 years 4 months ago
Optimizing Reaching Definitions Overhead in Queue Processors
Queue computers are a viable option for embedded systems design. Queue computers feature a dense instruction set, high parallelism, low hardware complexity. In this paper we propo...
Yuki Nakanishi, Arquimedes Canedo, Ben A. Abderaze...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 4 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
TCAD
2010
103views more  TCAD 2010»
12 years 11 months ago
Supervised Learning Based Power Management for Multicore Processors
- This paper presents a supervised learning based power management framework for a multi-processor system, where a power manager (PM) learns to predict the system performance state...
Hwisung Jung, Massoud Pedram
ISCA
2010
IEEE
205views Hardware» more  ISCA 2010»
13 years 9 months ago
The virtual write queue: coordinating DRAM and last-level cache policies
In computer architecture, caches have primarily been viewed as a means to hide memory latency from the CPU. Cache policies have focused on anticipating the CPU’s data needs, and...
Jeffrey Stuecheli, Dimitris Kaseridis, David Daly,...
ASPLOS
2004
ACM
13 years 10 months ago
An ultra low-power processor for sensor networks
We present a novel processor architecture designed specifically for use in low-power wireless sensor-network nodes. Our sensor network asynchronous processor (SNAP/LE) is based on...
Virantha N. Ekanayake, Clinton Kelly IV, Rajit Man...