Sciweavers

1502 search results - page 29 / 301
» Node weighted scheduling
Sort
View
MOBICOM
2009
ACM
14 years 4 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
IWQOS
2001
Springer
14 years 2 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell
RTSS
2003
IEEE
14 years 3 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan
ICC
2007
IEEE
14 years 4 months ago
Novel Link Weight for Path Construction Based on Overall QoS Index
— A weight or cost is usually assigned to each link for consideration in path construction, and the delay and loss rate have been used as conventional link weights. However, when...
Yudai Nitta, Taro Hashimoto, Katsuyoshi Iida, Kats...
MICS
2010
77views more  MICS 2010»
13 years 8 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger