Sciweavers

791 search results - page 151 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ASPLOS
2010
ACM
14 years 2 months ago
Power routing: dynamic power provisioning in the data center
Data center power infrastructure incurs massive capital costs, which typically exceed energy costs over the life of the facility. To squeeze maximum value from the infrastructure,...
Steven Pelley, David Meisner, Pooya Zandevakili, T...
ICALP
1998
Springer
13 years 11 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
ASPLOS
2010
ACM
13 years 10 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
BMCBI
2008
141views more  BMCBI 2008»
13 years 7 months ago
EzArray: A web-based highly automated Affymetrix expression array data management and analysis system
Background: Though microarray experiments are very popular in life science research, managing and analyzing microarray data are still challenging tasks for many biologists. Most m...
Yuerong Zhu, Yuelin Zhu, Wei Xu
VLSISP
2002
112views more  VLSISP 2002»
13 years 7 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai