Sciweavers

4 search results - page 1 / 1
» On-line scheduling with non-crossing constraints
Sort
View
ETT
2000
85views Education» more  ETT 2000»
13 years 4 months ago
Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
Marco Ajmone Marsan, Andrea Bianco, Emilio Leonard...
ECRTS
2009
IEEE
13 years 2 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler
ICA3PP
2010
Springer
13 years 9 months ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
CSCW
1998
ACM
13 years 9 months ago
Sustaining Mentoring Relationships On-Line
we have documented shares some of the influences discussed by Ackerman et. al., but has unique dynamics of its own which present unique technical and social demands. Using several ...
D. Kevin O'Neill, Louis M. Gomez