Sciweavers

3934 search results - page 39 / 787
» Approximate Schedulability Analysis
Sort
View
IWQOS
2005
Springer
14 years 3 months ago
Performance Analysis of Wireless Scheduling with ARQ in Fast Fading Channels
In this paper, we study the performance of opportunistic scheduling for downlink data transmissions with type-II packet-combining hybrid ARQ in a multirate cellular network for a f...
Hwee Pink Tan
RTSS
2002
IEEE
14 years 2 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min
RANDOM
1998
Springer
14 years 2 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
ANSS
2003
IEEE
14 years 3 months ago
Performance Analysis of Parallel Job Scheduling in Distributed Systems
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...
Helen D. Karatza, Ralph C. Hilzer Jr.