This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
Efficient Periodic Scheduling by Trees - Bar-Noy, Dreizin, Patt-Shamir (2002)(Correct)
In a perfectly-periodic schedule, time is divided into
time-slots, and each client gets a time slot precisely every predefined
number of time slots. The input to a schedule design algorithm
is a frequ... / design stage and the on-line scheduling task their on-line scheduling
Adaptive Load Sharing for Network Processors - Kencl, Le Boudec (2002)(Correct)
A novel scheme for processing packets in a router is presented, which provides for load sharing among multiple network processors distributed within the router. It is complemented by a feedback contro... / typically used. Such a global task scheduling heuristic usually takes some br H. H. Ali and T. Lewis. Task scheduling in multiprocessing systems.
Profile-based Dynamic Voltage Scheduling using Program Checkpoints - Azevedo, Issenin, Cornea, Gupta.. (2002)(Correct)
Dynamic voltage scaling (DVS) is a known effective
mechanism for reducing CPU energy consumption without
significant performance degradation. While a lot of work
has been done on inter-task scheduling... / of work has been done on inter-task scheduling algorithms to implement DVS br Chakrabarti. Variable voltage task scheduling for minimizing energy or
Hierarchical Multi Agent Reinforcement Learning - Makar, Mahadevan (2001)(Correct)
Hierarchical reinforcement learning methods have previously been
shown to speed up learning primarily in single-agent domains. In
this paper we explore the use of this spatio-temporal abstraction
m... / algorithm to a complex AGV scheduling task. Introduction br a in state s The AGV Scheduling Task Automated Guided Vehicles
Investigating the Effect of Voltage-Switching on Low-Energy Task.. - Swaminathan, Chakrabarty (2001)(Correct)
We investigate the effect of voltage-switching on task execution
times and energy consumption for dual-speed hard
real-time systems, and present a new approach for scheduling
workloads containing peri... / Voltage-Switching on Low-Energy Task Scheduling in Hard Real-Time Systems br systems using energy-aware task scheduling. We also show that switching
Hierarchical Multi-Agent Reinforcement Learning - Makar, Mahadevan, al. (2001)(Correct)
In this paper we investigate the use of hierarchical reinforcement
learning to speed up the acquisition of cooperative
multi-agent tasks. We extend the MAXQ framework
to the multi-agent case. Each age... / algorithm to a complex AGV scheduling task and compare its performance br Algorithm. . The Agv Scheduling Task Automated Guided Vehicles
Rate-Based Resource Allocation Models for Embedded Systems - Jeffay (2001)(Correct)
Run-time executives and operating system kernels for embedded
systems have long relied exclusively on static priority scheduling of tasks to
ensure timing constraints and other correctness conditi... / as well as application task scheduling. The type or class of br are met. In static priority scheduling tasks are assigned an integer
Embedded Software in Network Processors - Models and Algorithms - Thiele, Chakraborty, Gries.. (2001)(Correct)
We introduce a task model for embedded systems operating on packet streams, such as network processors. This model along with a calculus meant for reasoning about packet streams allows a unified treat... / such as packet scheduling task scheduling and architecture algorithm br two applications a a new task scheduling algorithm for network
A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling - Radulescu, van Gemund (2001)(Correct)
A relatively new trend in parallel programming scheduling is the so-called mixed task and
data scheduling. It has been shown that mixing task and data parallelism to solve large computational
applicat... / processors as opposed to pure task scheduling algorithms where a task runs br data-parallel M-tasks pure task scheduling techniques
Coordinated CPU and Event Scheduling for Distributed Multimedia.. - Poellabauer, Schwan, West (2001)(Correct)
Distributed multimedia applications require support from the underlying operating system to achieve and
maintain their desired Quality of Service (QoS). This has led to the creation of novel task and... / system services. However the task scheduling techniques developed to date br However the coordination of task scheduling with important game events
A Realistic Model and an Efficient Heuristic for Scheduling with.. - Beaumont, Boudet, Robert (2001)(Correct)
Scheduling computational tasks on processors is a key issue for highperformance
computing. Although a large number of scheduling heuristics
have been presented in the literature, most of them target... / computing resources. For each task scheduling algorithm the input is br H.H. Ali and T.G. Lewis. Task scheduling in multiprocessing systems.
Schedulability Analysis and Utilization Bounds for Highly Scalable.. - Abdelzaher, Lu (2001)(Correct)
The proliferation of high-volume time-critical web services
such as online trading calls for a scalable server
design that allows meeting individual response-time guarantees
of real-time transactions.... / usually refers to periodic task scheduling policies in which successive br Sha and J. Lehoczky. Aperiodic task scheduling for hard-real-time systems.
A Distributed Dynamic Routing Protocol For Arbitrary Networks - Erciyes (2001)(Correct)
We propose a two-level distributed routing protocol model for an arbitrary computer
network. The network is partitioned into domains and shortest routes are rst calculated
locally in each domain in t... / scienti c computation and task scheduling. Graph partitioning is an NP br algorithms for graphs for task scheduling and related problems exist
Continuous-Time Hierarchical Reinforcement Learning - Ghavamzadeh, Mahadevan (2001)(Correct)
Hierarchical reinforcement learning (RL) is
a general framework which studies how to
exploit the structure of actions and tasks
to accelerate policy learning in large domains.
Prior work in hierarchic... / on a complex multiagent AGV scheduling task. The rest of this paper is br the idea using the AGV scheduling task used as the experimental
Static-Priority Scheduling on Multiprocessors - Andersson, Baruah, Jonsson (2001)(Correct)
The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical multiprocessors is considered. A scheduling algorithm is proposed for static-priority scheduling of ... / of on-line real-time task scheduling. Real-Time Systems br processor. In global scheduling task migration is permitted.
Exploring Alternatives during Requirements Analysis - Mylopoulos, al. (2001)(Correct)
this article details the five
main steps that comprise goal-oriented analysis.
These steps include goal analysis, softgoal
analysis, softgoal correlation analysis, goal
correlation analysis, and evalu... / Let's suppose that the meeting-scheduling task is a generic goal we want to
Aperiodic Scheduling in a Dynamic Real-Time Manufacturing System - Salaheddine (2001)(Correct)
This paper addresses the problem of aperiodic
scheduling of manufacturing systems under Hard
Real-Time constraints. It adopts the extended version of
the Total Bandwidth Server Algorithm and extends i... / solve the problem of aperiodic task scheduling. A qualitative evaluation br and J. Lehoczky. Aperiodic Task Scheduling for Hard Real-Time Systems.
Adaptive Task and Resource Allocation in Multi-Agent Systems - Shaheen Fatima And (2001)(Correct)
In this paper, we present an adaptive organizational policy
for multi-agent systems called trace. trace allows a collection
of multi-agent organizations to dynamically allocate
tasks and resources bet... / problem multi-agent task scheduling is np-complete and br It is worth noting that the task scheduling problem trace is
EquiLoad: a load balancing policy for clustered web servers - Gianfranco Ciardo Alma (2001)(Correct)
We present a new strategy for the allocation of requests in clustered web servers, based
on the size distribution of the requested documents. This strategy, EquiLoad, manages to
achieve a balanced l... / This happens according to a task scheduling policy that aims at br a signi cant research eort in task scheduling and load balancing see
Parallelizing the Big Prime Berlekamp Algorithm with Distributed Maple - Schreiner (2001)(Correct)
We report on a parallel implementation of the Big Prime Berlekamp
algorithm with Distributed Maple. This implementation is based on three
parallel subalgorithms with di erent parallelization strategie... / low level details such as task scheduling and communication. The system br data cannot cause deadlocks in task scheduling. In the computation of the
A Lower Bound on the Chromatic Number of Mycielski Graphs - Caramia, Dell'Olmo (2001)(Correct)
In this work we give a new lower bound on the chromatic number
of a Mycielski graph M i . The result exploits a mapping between the
coloring problem and a multiprocessor task scheduling problem. The... / problem and a multiprocessor task scheduling problem. The tightness of br graphs Multiprocessor task scheduling. Introduction and
Manager-Worker Parallelism versus Data ow in a Distributed Computer.. - Schreiner (2001)(Correct)
We analyze two implementation variants of a parallel computer
algebra algorithm in Distributed Maple. The original solution uses
a manager-worker mechanism to control task scheduling, which requir... / mechanism to control task scheduling which requires an elaborate br with work i.e.the explicit task scheduling becomes a performance
Minimizing Average Completion of Dedicated Tasks and Partially.. - Halldórsson, Kortsarz.. (2001)(Correct)
Scheduling dependent jobs on multiple machines is modeled as a graph (multi)coloring
problem. The focus of this work is on the sum of completion times measure. This is known
as the sum (multi)colori... / system. In the biprocessor task scheduling problem we are given a set of br for the dedicated task scheduling problem P jfix j j P
Constraint-Based Timetabling - a Case Study - Abbas, Tsang (2001)(Correct)
This paper reports a case study in applying Constraint-Satisfaction techniques to university and school timetabling. It involves the construction of a substantial, carefully specified, fully tested an... / Timetabling is an instance of task scheduling which is a practical and
A Universal Client for Taskflow-Oriented Programming with Distributed .. - Lavana (2001)(Correct)
This paper presents an XML/TclTk implementation of a
universal, user-configurable client that (1) reads user-programmed
interconnections of distributed component programs
as task instances, (2) dynami... / files in cdtML and scheduling task instances for execution br files in cdtML and scheduling task instances for execution
Automatic Generation and Targeting of Application Specific Operating.. - Gauthier, Yoo, Jerraya (2001)(Correct)
We propose a method of automatic generation of application
specific operating systems (OS's) and automatic targeting
of application software. OS generation starts from a
very small but yet flexible OS... / sequencing in non-preemptive task scheduling. Table compares the above br up the task C Schedulers Task scheduling C Table shows the basic
An Ada Interface for Application-Defined Scheduling - Mario Aldea Rivas (2001)(Correct)
This paper presents an application program interface (API) that enables
applications to use application-defined scheduling algorithms in a way compatible
with the scheduling model of the Ada 95 Real... / adapted to the particular task scheduling policy. As we mentioned
Automatic Targeting of Embedded Systems Software with Application.. - Gauthier, Yoo, Jerraya (2001)(Correct)
We propose a method of automatic generation of application specific
operating systems (OS's) and automatic targeting of application
software. OS generation starts from a very small but yet flexible
OS... / sequencing in non-preemptive task scheduling. Table compares three br up the task C Schedulers Task scheduling C is given. Note that memory
A Schedulable Utilization Bound for Aperiodic Tasks - Abdelzaher (2000)(Correct)
In this paper, we derive a utilization bound on schedulability of apriodic tasks with arbitrary arrival
times, execution times, and deadlines. To the author's knowledge, this is the first time a utili... / for aperiodic fixed-priority task scheduling. Section derives the br of aperiodic fixed-priority task scheduling we therefore suggest a
CMAPS: A Cosynthesis Methodology for Application-Oriented Parallel.. - Hsiung (2000)(Correct)
ing with credit is permitted. To copy otherwise, to republish,
to post on servers, to redistribute to lists, or to use any component
of this work in other works, requires prior specific permission and... / system requires multiprocessor task scheduling Lin and Chen which br using each of the above three task scheduling algorithms TS k This
Algorithms For Rational Agents - Ronen (2000)(Correct)
Many recent applications of interest involve self-interested
participants. As such participants, termed agents, may manipulate the
algorithm for their own bene t, a new challenge emerges: The desi... / Beyond The Canonical Problem Task Scheduling The problems that we have br representative problem Task Scheduling There are k tasks that
On-line Scheduling via Sampling - Chang, Givan, Chong (2000)(Correct)
1
We consider the problem of scheduling an unknown
sequence of tasks for a single server as the tasks arrive with
the goal off maximizing the total weighted value of the tasks
served before their ... / other approaches. . On-line Task Scheduling with Deadlines We assume br assumptions this on-line scheduling task has no known optimal or
Formalisation of Scheduling for Hard Real Time Systems - Khan, Qiwen (2000)(Correct)
This work presents an approach for formalising real time properties and behaviour of the schedulers
for hard real time systems. A real time temporal logic known as Duration Calculus will
be used for f... / Calculus Aperiodic Task Scheduling . Jackson's Scheduling br . Periodic Task Scheduling . Rate Monotonic
Fast and Effective Task Scheduling in Heterogeneous Systems - Radulescu, van Gemund (2000)(Correct)
Recently, we presented two very low-cost approaches to
compile-time list scheduling where the tasks' priorities
are computed statically or dynamically, respectively. For
homogeneous systems, these two... / Fast and Effective Task Scheduling in Heterogeneous Systems br Keywords compile-time task scheduling list scheduling low-cost
An Enabling Framework for Master-Worker Applications on the.. - Jean-Pierre Goux Department (2000)(Correct)
We describe MW -- a software framework that allows
users to quickly and easily parallelize scientific computations
using the master-worker paradigm on the computational
grid. MW provides both a "top l... / such as fault tolerance task scheduling and interprocess br on different runs. . Task Scheduling Internally the MWDriver
Best Case Response Time Analysis for Improved Schedulability Analysis .. - Taewoong Kim Junghoon (2000)(Correct)
In distributed real-time systems, a task activated periodically
by the completion of its preceding task can be modeled
as a periodic task with activation jitter. An activation jitter
of a task is defi... / tasks have hard deadlines. The task scheduling algorithm must guarantee br DCTS distance constrained task scheduling transforms the periods of
Virtual Data Space - Load Balancing for Irregular Applications - Decker (2000)(Correct)
Load balancing is a key issue in the development of parallel algorithms with irregular
structures. Existing load balancing systems each support only one speci c
programming paradigm and thus are of li... / to deal with work distribution task scheduling and the control of the br are known in advance static task scheduling algorithms can be applied.
Dynamic Constraint Models for Planning and Scheduling Problems - Bartak (2000)(Correct)
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and scheduling problems are... / the planning and scheduling tasks are solved independently br Opposite to planning the scheduling task deals with the exact
Towards Mixed Planning and Scheduling - Bartak (2000)(Correct)
1 The conventional wisdom and practice is that planning and scheduling tasks are solved separately using different methods and approaches. However, recent development in industrial planning and sche... / practice is that planning and scheduling tasks are solved separately using br for mixing planning and scheduling tasks within single system. We
Real-Time Calculus For Scheduling Hard Real-Time Systems - Thiele, Chakraborty, Naedele (2000)(Correct)
This paper establishes a link between three areas, namely
Max-Plus Linear System Theory as used for dealing with
certain classes of discrete event systems, Network Calculus
for establishing time bound... / we will consider preemptive task scheduling with static priorities. In br resource models for processor task scheduling . Swiss Federal
Scheduling Distributed Real-Time Tasks in the DGMF Model - Chen, Mok (2000)(Correct)
Analytical results on the real-time scheduling of multiprocessor
systems have focussed on partitioning and distributing
the task set for scheduling on identical single processors,
with the assumption ... / Analytical results in real-time task scheduling research have mostly br to study distributed real-time task scheduling is to formally define the
Task Scheduling and Parallel Mesh-Sweeps in Transport Computations - Amato, An (2000)(Correct)
In this report, we describe the relationship between task scheduling and deterministic mesh
sweeps that arise in particle-transport computations. In particular, we argue that the ecient
parallelizatio... / Task Scheduling and Parallel Mesh-Sweeps in br the relationship between task scheduling and deterministic mesh
Analytic Modeling of Load Balancing Policies for Tasks with.. - Alma Riska Evgenia (2000)(Correct)
We present an analytic technique for modeling load balancing
policies on a cluster of servers conditioned on the
fact that the service times of arriving tasks are drawn
from heavy tail distributions. ... / This happens according to a task scheduling policy that aims to route br a signi cant research eort in task scheduling and load balancing see
A Task Scheduling Algorithm for Parallel Logic Programming Systems - Jie Tao Lrr-Tum (2000)(Correct)
In this article a task scheduling algorithm for
parallel logic programming systems and its implementation
in an And-Parallel prolog system
are described. This algorithm schedules under
centralized con... / A Task Scheduling Algorithm for Parallel Logic br Abstract In this article a task scheduling algorithm for parallel logic
Performance Monitoring on an HPVM Cluster - Sampemane, Pakin, al. (2000)(Correct)
Clusters of workstations are becoming popular
platforms for parallel computing, but performance
on these systems is more complex and harder to predict
than on traditional parallel machines. Hence,
per... / performance also increase-OS task scheduling network behavior and
Real-Time Task Scheduling for Energy-Aware Embedded Systems - Vishnu Swaminathan And (2000)(Correct)
We present a new approach for scheduling workloads
containing periodic tasks in real-time systems. The proposed
approach minimizes the total energy consumed by the
task set and guarantees that the dea... / Real-Time Task Scheduling for Energy-Aware Embedded br reduce energy consumption by scheduling tasks appropriately. Energy
OR Counterparts to AI Planning - Fourer (2000)(Correct)
The term Planning is not used in Operations Research
in the sense that is most common in Artificial Intelligence.
AI Planning does have many features in common
with OR scheduling, sequencing, routi... / Optimization Virtually any scheduling task can be viewed as a
Adaptive Scheduling for Master-Worker Applications on the.. - Heymann, Senar, Luque, Livny (2000)(Correct)
We address the problem of how many workers should be allocated
for executing a distributed application that follows the master-worker paradigm,
and how to assign tasks to workers in order to ma... / fault tolerance and task scheduling. Thus several high-level br considering the problem of task scheduling within a fixed number of
Polynomial Time Approximation Schemes for General Multiprocessor Job.. - Jansen, Porkolab (2000)(Correct)
We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most ordered operations that can be processed on... / set-constrained multiprocessor task scheduling Pmjset j jC max br variants of multiprocessor task scheduling dedicated parallel
Slot Models for Schedulers Enhanced by Planning Capabilities - Bartak (2000)(Correct)
Scheduling is one of the most successful application areas of
constraint programming and, recently, many scheduling problems were
modelled and solved by means of constraints. Most of these models ... / practice that planning and scheduling tasks are solved separately using br of parameters variables and the scheduling task is to find values of these
Solving Asymmetric Traveling Salesman Problems Using Dynamic.. - Brest, Zumer (2000)(Correct)
A method for dynamic scheduling on
a network computing system and an approximation
algorithm for solving the asymmetric traveling
salesman problem (ATSP) are presented in this paper.
Dynamic schedulin... / in Section . In Section task scheduling and load balancing are br are described. The simple task scheduling scheme and the algorithm for
Cacheminer: A Runtime Approach to Exploit Cache Locality on SMP - Yan, Zhang, Zhang (2000)(Correct)
Exploiting cache locality of parallel programs at runtime is a complementary approach to a compiler optimization. This is
particularly important for those applications with dynamic memory access patt... / multiprocessors SMP and task scheduling. INTRODUCTION T br and partitioning and our task scheduling algorithm. .
SC-Web-CS: Supply Chain Web-Centric Systems - Wu, Cobzaru, Ulieru, Norrie (2000)(Correct)
This paper proposes a generic framework, SC-webCS,
for the development of next generation web-centric
supply chain management systems. The framework builds
on our previously developed Multi-Resolution... / propose the Agent Network for Task Scheduling ANTS architecture with
Imprecise Task Scheduling and Overload Management using OR-ULD - Hansson, Thuresson, Son (2000)(Correct)
This paper evaluates the OR-ULD (Overload Resolution
using Utility Loss Density) algorithm for imprecise computation
workloads, where tasks are decomposed into one
mandatory task and one optional task... / Imprecise Task Scheduling and Overload Management br rates must be used when scheduling tasks with critical time
Low-Power Task Scheduling for Multiple Devices - Lu, Benini, De Micheli (2000)(Correct)
Power management saves power by shutting down idle
devices. These devices often serve requests from concurrently
running tasks. Ordering task execution can
adjust the lengths of idle periods and explo... / Low-Power Task Scheduling for Multiple Devices br in operating systems OS task scheduling for power management has not
Integrating Transportation in a Multi-Site Scheduling Environment - Sauer, Appelrath (2000)(Correct)
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites to manufacture the p... / scenario we will view it as a scheduling task on the local level as well. br Additionally like the scheduling tasks mentioned above the
Partial Servicing of On-line Jobs - van Stee, Poutré (2000)(Correct)
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize
the overall use of the machines. Service requests arrive online to be executed immediately; ... / is given for the problem of scheduling task sets that do not satisfy
Scalability and Scheduling in an Agent Architecture - Graham, Mersic, Decker (2000)(Correct)
For a given agent goal or objective there will be many different possible
task execution paths for achieving the goal. One method for achieving the
goal is to algorithmically determine the "best" ... / Experiments using different task scheduling algorithms were utilized to br for future research in agent task scheduling. The goals of the testing
Hierarchical Job Scheduling for Clusters of Workstations - Santoso Van Albada (2000)(Correct)
1
In this paper we study hierarchical job scheduling
strategies for clusters of workstations. Our approach
uses two-level scheduling: global scheduling
and local scheduling. The local scheduler refin... / At this level we also implement task scheduling of parallel jobs. The local
Preemptive Task Scheduling for Distributed Systems - Radulescu, van Gemund (2000)(Correct)
Task scheduling in a preemptive runtime environment has potential advantages
over the non-preemptive case such as better processor utilization and more flexibility
when scheduling tasks. Furthermo... / Preemptive Task Scheduling for Distributed Systems br The Netherlands Abstract. Task scheduling in a preemptive runtime
How Helpers Hasten h-Relations - Sanders, Solis-Oba (2000)(Correct)
We study the problem of exchanging a set of messages among a group of
processors, where messages may consist of different numbers of packets. We
consider the model of half-duplex communication. Let ... /
Development of Mixed Mode MPI / OpenMP Applications - Smith, Bull (2000)(Correct)
MPI / OpenMP mixed mode codes could potentially offer the most effective parallelisation strategy for an SMP cluster, as well as allowing the different characteristics of both paradigms to be exploite... / architecture and allows static task scheduling. The explicit parallelism
Variable Voltage Task Scheduling For Minimizing Energy Or Minimizing.. - Manzak, Chakrabarti (2000)(Correct)
In this paper we propose task scheduling algorithms
that minimize energy or minimize power for the case when
the tasks have different arrival times, deadline times, execution
times and switching activ... / Variable Voltage Task Scheduling For Minimizing Energy Or br In this paper we propose task scheduling algorithms that minimize
A Reusable Architecture for Satellite Control Software - Pasetti, Pree (2000)(Correct)
This paper is based on a project funded by the
European Space Agency unknown
AREUSABLEARCHITECTURE FOR SATELLITE CONTROL
SOFTWARE
A. Pasetti and W. Pree, Dept. of Computer Science, Univ. of Constanc... / functionalities related to task scheduling. The reuse model behind RTOS br Consider for instance task scheduling. At its simplest and using
Multiple Priority, Per Flow, Dual GCRA Rate Controller for ATM.. - Hagai (2000)(Correct)
We propose a rate controller for ATM switches. The rate controller supports multiple
priorities, and dual leaky bucket (GCRA) trac descriptors (such as VBR). While
regulating each stream independent... / scheduling mechanism. The link scheduling task is to resolve con icts
Manager-Worker Parallelism versus Dataflow in Distributed Maple - Schreiner (2000)(Correct)
We analyze two implementation variants of a parallel computer algebra
algorithm in Distributed Maple. The original (previously published)
solution uses a manager-worker mechanism to control task sch... / mechanism to control task scheduling which requires an elaborate br declarative programming task scheduling. Supported by the
Reliability-Driven Scheduling For Real-Time Tasks With Precedence.. - Xiao Hong Jiang (2000)(Correct)
Some work has been done in the past in
scheduling tasks in real-time distributed systems,
considering schedulability as the main objective function
to be maximized. Since real-time distributed syste... / of the objective functions for task scheduling. Simulation results show that br work in the area of real-time task scheduling in distributed systems
Adding Linear Constrains over Real Numbers to Curry - Lux (2000)(Correct)
Logic languages have been extended in two different routes. unknown Adding Linear Constrains over
Real Numbers to Curry
Wolfgang Lux
Universitat Munster
wlux@uni-muenster.de
/ numerical simulations or task scheduling. In addition there are well br an example consider the simple task scheduling problem given in Fig. .
Operating Systems for Safety-Critical Applications - By Dr Yinong (2000)(Correct)
This article discusses issues related to the computer software and operating systems
in safety-critical systems. unknown Elektron: the Journal of the South African Institute of the Electrical Engineer... / programmers have to worry about task scheduling memory sharing and
Elastic Feedback Control - Marco Caccamo Giorgio (2000)(Correct)
are used in schedulability analysis. With the advancement
of robotics, exible visual sensing using cameras
has become a popular alternative to the use of embedded
sensors. Unfortunately, the execution... /
A Jini-based Prototype Metacomputing Framework - Juhasz, Kesmarki (2000)(Correct)
This paper investigates the possible use of Jini technology for
building Java-based metacomputing environments. The paper presents
the structure of a prototype Jini metacomputing system. The overa... / our prototype the priorities in task scheduling is to minimize the number of br management allocating scheduling tasks load-balancing process
Unknown - (2000)(Correct)
This article
describes our Air Force-sponsored system to
accelerate network configuration by an
order-of-magnitude using multi-agent
planning techniques and thereby
dramatically reducing network confi... /
Towards Automatic Domain Knowledge Extraction for Evolutionary.. - Jelasity (2000)(Correct)
Domain knowledge is essential for successful problem solving and optimization. unknown Towards Automatic Domain Knowledge
Extraction for Evolutionary Heuristics*
Mfirk Jelasity
Research Group on Ar... / and so on -will make the scheduling task special. The fitness br common. At the same time the scheduling task is an NP-complete
A Real Bottom-Up Operating Systems Course - Bovet, Cesati (2000)(Correct)
this
paper on the second type of course, the standard elective fourth year course
of an Undergraduate program in Computer Science unknown A Real Bottom-Up Operating Systems Course
Daniel P. Bovet
Ma... / Linux like task switching and task scheduling. We continued along this
Mixing Planning and Scheduling to Model Complex Process Environments - Roman Bartk Charles (2000)(Correct)
Introduction
Planning and scheduling attract a high attention of computer science community because of
their real-life applicability and challenging complexity. However, despite of their similar
char... / the border between planning and scheduling task is shifted a bit and it br to solve mixed planning and scheduling tasks in complex process
Deadline Assignment To Reduce Output Jitter Of - Real-Time Tasks Taewoong (2000)(Correct)
In real-time control system, output jitter of a task is important when feedback
control loops are implemented as execution of periodic tasks. Output jitter refers to the
variation of response time o... / pinwheel problem to real-time task scheduling and transforms the periods br of distance constrained task scheduling Processor utilization Mean
QoS Adaptation In Real-Time Systems - Abdelzaher (1999)(Correct)
QOS ADAPTATION IN REAL-TIME SYSTEMS
by
Tarek F. Abdelzaher
Chair: Kang G. Shin
We propose to design, implement, and evaluate a software framework, called the Adaptware,
that consists of architectu... / message communication from task scheduling. The communication br a closed embedded system the task scheduling problem can be solved given
Synthesis of Hard Real-Time Application Specific Systems - Lee, Potkonjak, Wolf (1999)(Correct)
This paper presents a system level approach for the synthesis of hard real-time multitask application specific
systems. The algorithm takes into account task precedence constraints among multiple hard... / level optimizations such as task scheduling resource allocation and br of the allocated processors. Task scheduling refers to generation of
Scheduling and Data Management for Parallel Ray Tracing. - Reinhard (1999)(Correct)
Parallelising ray tracing with a data parallel approach allows rendering of arbitrarily large models, but
the inherent load imbalances may lead to severe inefficiencies. To compensate for the uneven l... / Task scheduling . br the overall performance. Task scheduling This chapter is concerned
A Framework for Generating Task Parallel Programs - Ursula Fissgus, Thomas Rauber.. (1999)(Correct)
We consider the generation of mixed task and data parallel programs and discuss how a
clear separation into a task and data parallel level can support the development of efficient
programs. The progra... / and how design decisions like task scheduling and data distribution can be br should be exploited task scheduling and how many of the
EMERALDS: a small-memory real-time microkernel - Khawar Zuberi Padmanabhan (1999)(Correct)
EMERALDS (Extensible Microkernel for Embedded, ReALtime,
Distributed Systems) is a real-time microkernel designed
for small-memory embedded applications. These applications
must run on slow (15--25MHz... / the basic OS services of task scheduling synchronization br take a core set of OS services task scheduling semaphores timers
Benchmarking and Comparison of the Task Graph Scheduling Algorithms - Kwok, Ahmad (1999)(Correct)
The problem of scheduling a parallel program represented by a weighted directed acyclic
graph (DAG) to a set of homogeneous processors for minimizing the completion time of the
program has been extens... / Ghose A Bottom-Up Approach to Task Scheduling on Distributed Memory br parallel processing scheduling task graphs scalability. This
Scheduling in the Dark - Edmonds (1999)(Correct)
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and
changing execution characteristics. The problem has been studied extensively when either the
jobs all a... / number of processors the scheduling task is to continually allocate
Algorithmic Mechanism Design - Nisan, Ronen (1999)(Correct)
We consider algorithmic problems in a distributed setting where the participants cannot
be assumed to follow the algorithm but rather their own self-interest. As such participants,
termed agents, are ... / of a representative problem task scheduling for which the standard br . We study a basic problem task scheduling which requires new
Nurse Scheduling Generalised - Kragelund, Mayoh (1999)(Correct)
The presence of a formal basis is of vital importance to realise an extensive
research on a real-life problem. For Sta Scheduling Problems (SSPs), this basis
seems to be missing. Apparently, this i... / and objectives. The scheduling task usually takes place br it is convenient to divide the scheduling task into independent tasks.
FASTEST: A Practical Low-Complexity Algorithm for Compile-Time.. - Kwok, Ahmad (1999)(Correct)
In the area of parallelizing compilers considerable research has been carried out on data
dependency analysis, parallelism extraction, as well as program and data partitioning. However,
designing a pr... / H.H. Ali and T.G. Lewis Task Scheduling in Multiprocessing Systems br parallelization compile-time scheduling task graphs multiprocessors
Sharing Resources among Periodic and Aperiodic Tasks with Dynamic.. - Caccamo, Lipari, Buttazzo (1999)(Correct)
In this paper, we address the problem of scheduling hybrid
task sets consisting of hard periodic and soft aperiodic
tasks that may share resources in exclusive mode in a dynamic
environment, where tas... / is integrated with periodic task scheduling both under the RM algorithm br and J.P. Lehoczky Aperiodic Task Scheduling for Hard-Real-Time Systems
Efficient Value Function Approximation Using Regression Trees - Wang, Dietterich (1999)(Correct)
Value function approximation is a problem central to reinforcement learning. Many applications of reinforcement learning have relied on neural network function approximators, which are very slow to tr... / good performance on a job-shop scheduling task and that it can be trained br On a resource-constrained scheduling task the regression tree method
Effective Complexity Reduction for Optimal Scheduling of Distributed.. - Jonsson (1999)(Correct)
The application of optimal search strategies to scheduling
for distributed real-time systems is, in general, plagued
by an inherent computational complexity. This has effectively
prevented the integra... / the choice of an arbitrary task scheduling operation. This is in br the end-to-end deadline. . Task scheduling In order to satisfy
On the Edge of Planning and Scheduling: A Study - Bartak (1999)(Correct)
Planning and scheduling are areas attracting an unceasing attention of computer
science community. However, despite of their similar character, planning and scheduling
problems are usually handled i... / border between planning and scheduling tasks is moved to a different level br for mixing both planning and scheduling tasks within single system and we
Experimental Assessment of the Period Calibration Method: A Case Study - Kim (1999)(Correct)
In this paper we present an experimental evaluation of the period calibration method
(PCM) which was developed in (Gerber et al., 1994; Gerber et al., 1995) as a systematic design
methodology for re... / major cycle completely defines task scheduling. Minor cycles are used for br digital controller real-time scheduling task graph design methodology
Transparent Replication for Fault Tolerance in Distributed Ada 95 - Wolf (1999)(Correct)
In this paper we present the foundations of RAPIDS
("Replicated Ada Partitions In Distributed Systems"), an
implementation of the PCS supporting the transparent replication
of partitions in distribute... / partition for instance task scheduling may well violate the order br is strongly reduced and task scheduling is restricted or even
Instruction Pre-Processing in Trace Processors - Jacobson, Smith (1999)(Correct)
In trace processors, a sequential program is
partitioned at run time into "traces." A trace is an
encapsulation of a dynamic sequence of instructions. A
processor that uses traces as the unit of sequ... / issue logic to complete the scheduling task. When an instruction is
Dynamic Task Migration in Home-based Software DSM Systems - Shi, Hu, Tang, Eskicioglu (1999)(Correct)
Task migration is an effective strategy to achieve load balancing and high resource utilization in a meta-computing environment. In this paper, we argue that traditional task migration methods take in... / the processors. The dynamic task scheduling technique proposed by Liang br D-C. Liu and W. Zhu. Dynamic task scheduling on multithreaded distributed
Fault Tolerance by Transparent Replication for Distributed Ada 95 - Wolf, Strohmeier (1999)(Correct)
This paper presents the foundations of RAPIDS ("Replicated Ada
Partitions In Distributed Systems"), an implementation of the Distributed
Systems Annex E incorporating the transparent replication of ... / generally are multitasked and task scheduling may well violate the order br of time-sliced pre-emptive task scheduling or by varying message