Results 291 to 300 of about 95,650 (334)

Deterministic and stochastic scheduling with teamwork tasks

Naval Research Logistics (NRL), 2004
AbstractWe study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task.
Cai, Xiaoqiang, Zhou, Xian
openaire   +2 more sources

FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability

2007 IEEE International Conference on Communications, 2007
In this paper, we focus on applications having quantitative QoS (Quality of Service) requirements on their end-to-end response time. Two types of quantitative QoS garantees can be delivered by a network, deterministic and probabilistic. The deterministic approach is based on a worst case analysis. The probabilistic approach uses a mathematical model to
Azouz Saidane, Leila, Azzaz, Skander, Martin, Steven, Minet, Pascale   +3 more
openaire   +2 more sources

Deterministic multiprocessor scheduling with multiple objectives

Computers & Operations Research, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Epstein, Sheldon, Wilamowsky, Yonah, Dickman, Bernard   +2 more
openaire   +1 more source

Deterministic scheduling for transactional multithreaded replicas

Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000, 2000
One way to implement a fault-tolerant service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request is executed by all the replicas. Thus, the effects of failures can be completely masked, resulting in an increase of service availability.
R. Jimenez-Peris, M. Patino-Martinez, S. Arevalo   +2 more
openaire   +1 more source

Deterministic Project Scheduling with No Resource Constraints

2021
Project schedules, which are the basic components of project plans, specify when activities are to be performed and constitute the basis for allocating the resources to activities. In this chapter we use mathematical modeling to formulate and solve scheduling problems for single and multiple project settings.
Gündüz Ulusoy, Öncü Hazır
openaire   +1 more source

A non-deterministic scheduler for a software pipelining compiler

ACM SIGMICRO Newsletter, 1992
In this paper, we present a novel approach to the problem of code generation in a software pipelining compiler. To avoid the introduction of dedicated heuristics, we apply a general search technique, formulating the scheduling problem as a combinatorial optimization problem in terms of a Boltzmann Machine, a powerful statistical algorithm based on the ...
DE GLORIA, ALESSANDRO, P. Faraboschi, i. M. Olivieri   +2 more
openaire   +3 more sources

An integrated survey of deterministic project scheduling

Omega, 2001
Abstract There have been many survey papers in the area of project scheduling in recent years. These papers have primarily emphasized modeling and algorithmic contributions for specific classes of project scheduling problems, such as net present value (NPV) maximization and makespan minimization, with and without resource constraints.
R Kolisch, R Padman
openaire   +1 more source

Hindsight helps: deterministic task scheduling with backtracking

Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162), 2002
This paper considers the problem of scheduling a set of precedence-related tasks on a nonpreemptive homogeneous message-passing multiprocessors system in order to minimize the makespan, that is, the completion time of the last task relative to start time of the first task. We propose family of scheduling algorithms, called IPR for immediate predecessor
null Yueh-O Wang, N.M. Amato, D.k. Friesen   +2 more
openaire   +1 more source

Deterministic Batch Scheduling without Static Partitioning

1999
The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range scheduling decisions are made by Miser, a user level daemon, which reserves the resources needed by a batch job to complete its tasks.
Kostadis Roussos, Nawaf Bitar, Robert English   +2 more
openaire   +1 more source

Deterministic preemptive scheduling of real-time tasks

Computer, 2002
Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks.
L.E. Jackson, G.N. Rouskas
openaire   +1 more source