Sciweavers

388 search results - page 24 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ISCAPDCS
2007
13 years 10 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
FAST
2007
13 years 10 months ago
Proportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
Yin Wang, Arif Merchant
IJHIS
2007
89views more  IJHIS 2007»
13 years 8 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
ANOR
2010
130views more  ANOR 2010»
13 years 6 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
TNN
2010
173views Management» more  TNN 2010»
13 years 3 months ago
Global synchronization for discrete-time stochastic complex networks with randomly occurred nonlinearities and mixed time delays
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
Zidong Wang, Yao Wang, Yurong Liu