Sciweavers

2515 search results - page 375 / 503
» Interval Availability Distribution Computation
Sort
View
JSSPP
2007
Springer
15 years 10 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 5 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
CACM
2005
126views more  CACM 2005»
15 years 4 months ago
Extrovert gadgets
This paper presents a set of architectures for the composition of ubiquitous computing applications. It describes research that is being carried out in "extrovert-Gadgets&quo...
Achilles Kameas, Irene Mavrommati
IPPS
2009
IEEE
15 years 11 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
142
Voted
ICS
2007
Tsinghua U.
15 years 10 months ago
Optimization and bottleneck analysis of network block I/O in commodity storage systems
Building commodity networked storage systems is an important architectural trend; Commodity servers hosting a moderate number of consumer-grade disks and interconnected with a hig...
Manolis Marazakis, Vassilis Papaefstathiou, Angelo...