Results 271 to 280 of about 3,968 (305)
Some of the next articles are maybe not open access.
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers, 1986The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its
Jacek Blazewicz +2 more
openaire +2 more sources
Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2011Energy efficiency of data centers has draw a great attention due to the cost of power consumption increases dramatically as the size of data center grows. Nowadays, Map Reduce is a framework widely used for processing large data sets in data center, its energy efficiency directly affects the energy efficiency of data center.
Tao Zhu, Chengchun Shu, Haiyan Yu
openaire +1 more source
Insertion scheduling: An alternative to list scheduling for modulo schedulers
1996The list scheduling algorithm is a popular scheduling engine used in most, if not all, industrial instruction schedulers. However this technique has several drawbacks, especially in the context of modulo scheduling. One such problem is the need to restart scheduling from scratch whenever scheduling fails at the current value of the initiation interval.
openaire +1 more source
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
A pattern is a sequence of disjoint intervals on a circle together with fixed distances between these intervals. The intervals may be interpreted as tasks of a job which is produced periodically on one machine. The problem consists in moving r patterns relative to each other to minimize the maximum overlapping of intervals (machines needed).
Peter Brucker, Ulrich Kathmann
openaire +1 more source
A pattern is a sequence of disjoint intervals on a circle together with fixed distances between these intervals. The intervals may be interpreted as tasks of a job which is produced periodically on one machine. The problem consists in moving r patterns relative to each other to minimize the maximum overlapping of intervals (machines needed).
Peter Brucker, Ulrich Kathmann
openaire +1 more source
Schedules and Counter schedules
2005Abstract Every compensation claim will need a Schedule of Special Damages. In every assessment of damages, the Schedule of Special Damages and the counter schedule will be the main working documents. In every detailed negotiation, these documents will be the first point of reference for assessing the value of the claim.
openaire +1 more source
Oz Scheduler: a workbench for scheduling problems
Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence, 2005This paper describes the Oz Scheduler; a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different propagation behavior or distribution and search strategies.
openaire +1 more source
Structural schedulings in the problems of scheduling theory
Journal of Soviet Mathematics, 1983This paper is devoted to a class of problems for which there exist optimal structure schedulings. One presents the solutions of two problems of scheduling theory. One analyzes the similarities and the differences in the formulation between the problems of this class and the traditional problems of scheduling theory.
openaire +1 more source
Scheduling a Metacomputer with Uncooperative Sub-schedulers
1999The main advantage of a metacomputer is not its peak performance but better utilization of its machines. Therefore, efficient scheduling strategies are vitally important to any metacomputing project. A real metacomputer management system will not gain exclusive access to all its resources, because participating centers will not be willing to give up ...
Jörn Gehring, Thomas Preiss
openaire +1 more source
The Hybrid Schedule: Scheduling to the Curriculum
NASSP Bulletin, 1995A series of experiments with single and double mod scheduling led to a highly flexible schedule that meets the needs of the teachers and students at this large suburban school.
Gerald L. Boarman +1 more
openaire +1 more source
Bridging the gap between self schedules and feasible schedules in staff scheduling
Annals of Operations Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

