Sciweavers

98 search results - page 13 / 20
» Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Sort
View
RTAS
2005
IEEE
14 years 1 months ago
Optimal Time-Variant Resource Allocation for Internet Servers with Delay
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
Xiliang Zhong, Cheng-Zhong Xu, Minghua Xu, Jianbin...
TCOM
2008
74views more  TCOM 2008»
13 years 7 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
PDP
2002
IEEE
14 years 25 days ago
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...
Chun-Hua Yang, Geert Deconinck
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 8 months ago
Enhanced Energy-Aware Feedback Scheduling of Embedded Control Systems
Dynamic voltage scaling (DVS) is one of the most effective techniques for reducing energy consumption in embedded and real-time systems. However, traditional DVS algorithms have in...
Feng Xia, Longhua Ma, Wenhong Zhao, Youxian Sun, J...
ANOR
2008
171views more  ANOR 2008»
13 years 8 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet