Sciweavers

10 search results - page 2 / 2
» Dispatchability Conditions for Schedules with Consumable Res...
Sort
View
EOR
2006
107views more  EOR 2006»
13 years 5 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
ISPAN
2005
IEEE
13 years 10 months ago
A Scalable Method for Predicting Network Performance in Heterogeneous Clusters
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such ...
Dimitrios Katramatos, Steve J. Chapin
JSAC
2008
120views more  JSAC 2008»
13 years 5 months ago
Optimal joint probing and transmission strategy for maximizing throughput in wireless systems
Abstract-- In broadcast fading channel, channel variations can be exploited through what is referred to as multiuser diversity and opportunistic scheduling for improving system per...
Prasanna Chaporkar, Alexandre Proutiére
BROADNETS
2004
IEEE
13 years 9 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
ICDCSW
2008
IEEE
13 years 11 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu