Sciweavers

1257 search results - page 35 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ICS
1999
Tsinghua U.
15 years 4 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
CCGRID
2006
IEEE
15 years 5 months ago
SAHA: A Scheduling Algorithm for Security-Sensitive Jobs on Data Grids
Security-sensitive applications that access and generate large data sets are emerging in various areas such as bioinformatics and high energy physics. Data grids provide data-inte...
Tao Xie 0004, Xiao Qin
128
Voted
WCE
2007
15 years 27 days ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
SIGMETRICS
2010
ACM
178views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Optimality, fairness, and robustness in speed scaling designs
System design must strike a balance between energy and performance by carefully selecting the speed at which the system will run. In this work, we examine fundamental tradeoffs i...
Lachlan L. H. Andrew, Minghong Lin, Adam Wierman
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 4 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...