Sciweavers

1792 search results - page 193 / 359
» Improved scheduling in rings
Sort
View
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 9 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ICUMT
2009
14 years 9 months ago
Performance of relay-enabled uplink in cellular networks - a flow level analysis
Uplink users in cellular networks, such as UMTS/ HSPA, located at the edge of the cell generally suffer from poor channel conditions. Deploying intermediate relay nodes is seen as ...
Desislava C. Dimitrova, Hans van den Berg, Geert J...
120
Voted
CONSTRAINTS
2011
14 years 6 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck
RTSS
2009
IEEE
15 years 6 months ago
On the Scheduling of Mixed-Criticality Real-Time Task Sets
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
Dionisio de Niz, Karthik Lakshmanan, Ragunathan Ra...
RTAS
2008
IEEE
15 years 6 months ago
Schedulability Analysis of MSC-based System Models
Message Sequence Charts (MSCs) are widely used for describing interaction scenarios between the components of a distributed system. Consequently, worst-case response time estimati...
Lei Ju, Abhik Roychoudhury, Samarjit Chakraborty