Sciweavers

1095 search results - page 146 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
HPDC
2010
IEEE
14 years 11 months ago
Cluster-wide context switch of virtualized jobs
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
Fabien Hermenier, Adrien Lebre, Jean-Marc Menaud
ISPA
2007
Springer
15 years 4 months ago
Channel Assignment and Spatial Reuse Scheduling to Improve Throughput and Enhance Fairness in Wireless Mesh Networks
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
Nguyen H. Tran, Choong Seon Hong
IPPS
1993
IEEE
15 years 2 months ago
Parallel Algorithms for Hypercube Allocation
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
Yeimkuan Chang, Laxmi N. Bhuyan
DATAMINE
2006
176views more  DATAMINE 2006»
14 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
IPPS
2008
IEEE
15 years 4 months ago
Providing flow based performance guarantees for buffered crossbar switches
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...
Deng Pan, Yuanyuan Yang