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.
12148.7 Temporal and Real-Time Databases: A Survey - Ozsoyoglu, Snodgrass (1995)(Correct)
A temporal database contains time-varying data. In a real-time database transactions
have deadlines or timing constraints. In this paper we review the substantial research in
these two heretofore sepa... / can be obtained and real-time task scheduling techniques can be used to br conventional databases and the task scheduling techniques for real-time
6245.0 Scheduling And Code Generation For Parallel Architectures - Yang (1993)(Correct)
OF THE DISSERTATION
Scheduling and Code Generation for Parallel
Architectures
by Tao Yang, Ph.D.
Dissertation Director: Professor Apostolos Gerasoulis
Automatic partitioning, scheduling and code gener... / . Ph. Chretienne Task Scheduling over Distributed Memory br A. Gerasoulis PYRROS Static task scheduling and code generation for
5744.8 Scheduling Support Mechanisms for Autonomous, Heterogeneous.. - Chapin (1993)(Correct)
xi
1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
1.1 Statement of Thesis : : : : : : : : : : :... / . . Extensions to the Task Scheduling Mechanism br system there are two levels of task scheduling the association of tasks
5466.8 GLR*: A Robust Grammar-Focused Parser for Spontaneously Spoken.. - Lavie (1996)(Correct)
The analysis of spoken language is widely considered to be a more challenging task than the
analysis of written text. All of the difficulties of written language can generally be found in
spoken langu... / tokens for the appointment scheduling task was developed from a set of
5333.9 An Object-Oriented Real-Time Database System For Multiprocessors. - Lortz (1994)(Correct)
AN OBJECT-ORIENTED REAL-TIME DATABASE SYSTEM FOR
MULTIPROCESSORS.
by
Victor Bradley Lortz
Chair: Kang G. Shin
Complex real-time systems need databases to support concurrent data access and provide
wel... / Database Transaction Times and Task Scheduling . br threads and multiple task scheduling policies. A major emphasis in
4932.6 On The Implementation And Effectiveness Of Autoscheduling For.. - Moreira (1995)(Correct)
processors
Physical
processors
Alignment
Distribution
dependent mapping
Implementation
Figure 3.4 HPF approach to data partition and distribution.
states that iteration i is to be executed by ... / . Task Scheduling br the alternative formulation task scheduling is derived exclusively from
4913.1 Maximizing Memory Bandwidth for Streamed Computations - McKee (1995)(Correct)
Processor speeds are increasing much faster than memory speeds, and thus memory bandwidth is rapidly becoming the limiting performance factor for many applications, particularly those whose inner loop... / Models Performance Task Scheduling Factors Ordering Policies br algorithms. In particular the taskscheduling technique may change the
4679.6 An Annotated Bibliography on Real-Time Database Systems - Ulusoy (1995)(Correct)
Introduction
This is an annotated bibliography on real-time
database systems, a field which has emerged as a result
of the growing interest in applying the principles
and techniques of real-time sche... / field has been to adapt the task scheduling methods used in real-time
4352.8 Parallel Processing of Discrete Optimization Problems - Ananth, Kumar, Pardalos (1992)(Correct)
Discrete optimization problems (DOPs) arise in various applications such as planning,
scheduling, computer aided design, robotics, game playing and constraint directed reasoning.
Often, a DOP is formu... / e.g. robot motion planning task scheduling require real time solutions.
4322.4 Synthesis Of Application-Specific Real-Time Computing Systems - Alqadi (1995)(Correct)
Due to the stringent timing constraints, designing a computer control system for a
real-time application is a challenging problem. This dissertation alleviates this problem
by developing a systematic ... / . . Related Work on Task Scheduling br work. . . Related Work on Task Scheduling Uniprocessor Scheduling.
4182.3 Speculative Execution in Real-Time Systems - Ghosh (1995)(Correct)
ion and Its Implementation : : : : : : : : : : : : : : : : : : : : 96
5.2.1 Abstraction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 96
5.2.2 Implementation : : : : : : : : : : : : ... / thread creation and task scheduling by offering separate br be run before any other task. Scheduling this task involves traversing
3973.4 Rule-Based Program Restructuring For High Performance Parallel.. - Tenny (1992)(Correct)
Writing good programs for high performance parallel computers is difficult. The
programmer must have a deep understanding of the underlying machine architecture.
Issues such as memory hierarchy, commu... / processor architecture task scheduling and processor allocation br processor architecture task scheduling and processor allocation
3943.3 Query Processing in Firm Real-Time Database Systems - Pang (1994)(Correct)
this memory is used to hold the hash table for the first partition; the R and S tuples that belong to
this partition can thus be joined in memory directly as S is being scanned. The Hybrid Hash Join a... / To date a number of real-time task scheduling policies have been proposed
3842.6 Cognitive Modeling and Group Adaptation in Intelligent Multi-Agent.. - Leonardo Garrido(Correct)
In the framework of meeting scheduling problems, we present an approach where for
every agent the behavior of other agents is explained in terms of a common cognitive
structure. This structure account... / role in the distributed meeting scheduling task specially if we are br support for the meeting scheduling task taking into account user
3677.2 Predictive Scheduling for Distributed Computing - Russ, Lambert, Camenisch, Velusamy..(Correct)
Scheduling parallel jobs across distributed, possibly heterogeneous, computing
resources is an increasingly important capability because of the increase of available
distributed resources and of paral... / done on evaluating flexible task scheduling algorithms for dis- br H.G.Taxonomy of Dynamic Task Scheduling Schemes in Distributed
3649.3 Ray Tracing Abstracts Survey - Wilson(Correct)
This chapter deals with the influence of diffracted waves on tomographic observations. Probably most
workers in tomography are aware of the existence of such waves and of their potential to interfe... / for ray tracing based on task scheduling. Subtasks involved in
3566.3 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
3450.8 Transactions In Transactional Workflows - Worah, Sheth(Correct)
Workflow management systems (WFMSs) are finding wide applicability
in small and large organizational settings. Advanced transaction models
(ATMs) focus on maintaining data consistency and have pro... / system errors that affect the task scheduling mechanism communication
3390.2 Neelpros: A Predictable Real-Time Kernel Layer Design For Multimedia - Sharma (1998)(Correct)
OF THE DISSERTATION
NEELPROS: A Predictable Real-Time
Kernel Layer Design for Multimedia
By Atul Sharma
Dissertation Director: Professor James L. Flanagan
New multimedia applications e.g. telecon... / . Task Scheduling br of Cyclic Scheduler is a Task scheduling unit of the Communication
3388.7 Multi-Resource Parallel Query Scheduling and Optimization - Garofalakis, Ioannidis(Correct)
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems,
where each site consists of a collection of local time-shared (e.g., CPU(s) or disk(s)) and space-s... / models of parallel task scheduling effectively ignoring the br body of work on parallel task scheduling in the field of
3266.3 Automap: A Parallel Coordination-based Programming System - van Reeuwijk, Sips, Lin, van Gemund (1997)(Correct)
High Performance Computing (HPC) has been defined as a key enabling technology for industrial
competitiveness. The successful use of parallel computer technology requires the development
of techniques... / Hence data allocation and task scheduling can only be done at run-time. br communication costs. Although task scheduling will be performed at
3215.7 Predicting the Performance of Software Systems - Rolia (1992)(Correct)
With the advent of distributed and multi-processor computing, systems of cooperating
processes have become an attractive alternative to monolithic programs. In
such software systems it is often possib... / . c Processor Allocation and Task Scheduling Disciplines for Example . br . c Processor Allocation and Task Scheduling Disciplines for Example a.
3193.7 Analyzing the Behavior and Performance of Parallel Programs - Adve (1993)(Correct)
An analytical performance model for parallel programs can provide qualitative insight as well
as efficient quantitative evaluation and prediction of parallel program performance. While stochastic
mode... / . . . Specifying the Task Scheduling Function br PSIM with processor-splitting task scheduling . .
3166.7 Parallel Query Processing Using Shared Memory Multiprocessors and.. - Hong (1992)(Correct)
my research. I will also
remember that it was from them that I learned how to appreciate a good beer and enjoy a
good party.
I would like to thank my fellow students Yongdong Wang and Chuen-tsai Sun ... / Parallel Task Scheduling . Problem Definition br . Integration with Task Scheduling Algorithm
3152.4 Scheduling Multiprocessor Tasks on Dedicated Processors - Krämer (1995)(Correct)
this paper for a detailed description.
7.3.2 An algorithm based on the calculation of partially directed comparability
graphs unknown Scheduling Multiprocessor Tasks
on Dedicated Processors
Dissertati... / Foundations Multiprocessor task scheduling problems on dedicated br types of multiprocessor task scheduling problems on dedicated
3151.4 Regular versus irregular problems and algorithms. - Gautier, Roch, Villard (1995)(Correct)
Viewing a parallel execution as a set of tasks that execute
on a set of processors, a main problem is to find a schedule of the tasks
that provides an efficient execution. This usually leads to divi... / to free the user from task scheduling. An implementation PACis br as list ranking may rely on task scheduling solutions There is also
3141.4 On Scheduling Atomic and Composite Multimedia Objects - Cyrus Shahabi (1995)(Correct)
In multi-user multimedia information systems (e.g., movie-on-demand, digital-editing), scheduling the
retrievals of continuous media objects becomes a challenging task. This is because of both intra a... / of this study. To tackle this task scheduling problem CRS we start with br this time dependency at the task scheduling level can be mapped to X
3044.6 Hardware And Compiler Support For Cache Coherence In Large-Scale.. - Choi (1996)(Correct)
ompiler can detect
potentially stale references and what kind of performance can be obtained using a real
compiler.
iii
Also, most of the compiler-directed coherence schemes proposed to date have no... / . . Task scheduling issues br by considering a more flexible task scheduling model that allows context
3038.4 CABINS: A Framework of Knowledge Acquisition and Iterative Revision.. - Miyashita, Sycara (1995)(Correct)
Practical scheduling problems generally require allocation of resources in the presence of a large, diverse and typically conflicting set of constraints and optimization criteria. The ill-structuredne... / Introduction The scheduling task can be described as assigning br increase search efficiency in scheduling tasks for NASA Space Shuttle
3033.5 Simulation Of Static And Dynamic Task Scheduling On Multiprocessor.. - Dimitriou (1994)(Correct)
CONTENTS
Page
1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
2 THE PROBLEM OF TASK SCHEDULING ON PARALLEL PROCESSING
SYSTEMS : : : : : : : : : : : : : : : : : : : :... / Of Static And Dynamic Task Scheduling On Multiprocessor Systems br The Problem Of Task Scheduling On Parallel Processing
2961.5 Dynamic Access Ordering for Symmetric Shared-Memory Multiprocessors - McKee (1994)(Correct)
Dynamic Access Ordering for Symmetric SharedMemory
Multiprocessors
Sally A. McKee
Department of Computer Science
University of Virginia
Charlottesville, VA 22903
mckee@cs.virginia.edu
Memory bandwidth... / are presented together. . Task Scheduling The way in which a problem br Static Scheduling For static task scheduling each of CEs performs every
2936.7 A Tabu Search Approach to Task Scheduling on Heterogeneous Processors .. - Porto, Ribeiro (1993)(Correct)
Parallel programs may be represented as a set of interrelated sequential tasks. When multiprocessors
are used to execute such programs, the parallel portion of the application can be speeded up by
an ... / A Tabu Search Approach to Task Scheduling on Heterogeneous Processors br precedence graph the goal of task scheduling or processor assignment is
2928.3 Dependence Driven Execution for Data Parallelism - Vajracharya(Correct)
This thesis proposes an efficient run-time system to schedule general nested loops on multiprocessors.
The work extends existing one-dimensional loop scheduling strategies such as static scheduling,
a... /
2882.5 Scheduling Of Regular And Irregular Computations: A System and.. - Gerasoulis, Jiao, Yang (1995)(Correct)
We study the performance of task graph scheduling for both regular and irregular parallel computation.
We present a scheduling tool named PYRROS, which takes as an input a task graph and a
compile tim... / Ph. Chretienne Task Scheduling over Distributed Memory br A. Gerasoulis PYRROS Static task scheduling and code generation for
2877.4 A Fast and High Quality Multilevel Scheme for. . . - Karypis, Kumar (1998)(Correct)
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of
the graph by collapsing vertices and edges, partition the smaller graph, and then u... / computing VLSI design and task scheduling. The problem is to partition
2837.4 End-to-End Scheduling to Meet Deadlines in Distributed Systems - Bettati (1994)(Correct)
urce access protocols
and thus increase the utilization of resources.
iii
To my parents, Aldo and Maria-Rosa Bettati
iv
Acknowledgements
My deepest gratitude goes to Prof. Jane Liu, who five years... / and J.P. Lehoczky. Aperiodic task scheduling for hard real-time systems. br . Algorithm PCC for Scheduling Task Sets with Two Classes of
2723.3 An Overview of the NYU Ultracomputer Project - Gottlieb (1986)(Correct)
The NYU Ultracomputer is a shared memory MIMD parallel computer design to contain
thousands of processors connected by an Omega network to a like number of
memory modules. A new coordination primitive... / on the Ultracomputer the task scheduling and memory management br of different jobs. The task scheduling scheme described above can be
2687.8 Communication Sensitive Loop Scheduling for DSP Applications - Tongsima, Sha, Passos (1997)(Correct)
The performance of computation intensive digital signal processing applications running
on parallel systems is highly dependent on communication delays imposed by the parallel
architecture. In order t... / is the need for an efficient task scheduling algorithm which considers br and Kaneshiro proposed a task scheduling framework for multiprocessor
2686.7 Program timing analysis - Chapman (1994)(Correct)
This report is submitted as a first year qualifying dissertation. The field of
program timing analysis is surveyed in detail. The review includes details of
relevant static analysis techniques, high-l... / Application of predictable task scheduling algorithms. Detection br predictability. A theory of task scheduling in Ada- X should be
2671.3 A Framework for Exploiting Data and Functional Parallelism on.. - Ramaswamy, Sapatnekar, Banerjee (1994)(Correct)
Recent research efforts have shown the benefits of integrating functional and data parallelism
over using either pure data parallelism or pure functional parallelism. The work in this paper presents a... / Processor Allocation Parallel Task Scheduling Macro Dataflow Graphs br the Partitionable Independent Task Scheduling Problem in the Proceedings
2586.8 A Deterministic Model for Parallel Program Performance Evaluation - Vikram Adve (1998)(Correct)
Parallelism Metrics
Previous studies have shown that a few key parameters such as the fraction of sequential
work [Amdahl 1967], average parallelism [Eager et al. 1989], and variance
of parallelism [... / task graphs a wide variety of task scheduling policies shared-memory br analysis of synchronization task scheduling the order of task execution
2476.8 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
2447.4 An Overview of the MESSIAHS Distributed Scheduling Support System - Chapin, Spafford (1993)(Correct)
Users often find that local resources are too limited to solve large computing
problems. At the same time, unused machines remain inaccessible because
of incompatible architectures, ignorance of their... / system there are two levels of task scheduling the association of tasks br may become unavailable for task scheduling because of policy
2438.2 Large-Scale Planning Under Uncertainty: A Survey - Littman, Majercik(Correct)
Our research area is planning under uncertainty,
that is, making sequences of decisions in the face
of imperfect information. We are particularly concerned
with developing planning algorithms that
per... / configurations. The basic scheduling task is enormously complicated br elements of uncertainty in the scheduling task Chien et al.
2416.0 Mapping Arbitrary Non-Uniform Task Graphs onto Arbitrary Non-Uniform.. - Song Chen (1995)(Correct)
this paper, a generic technique for clustering and mapping arbitrary task graphs onto
arbitrary system graphs is presented. The task and system graphs studied in this paper have
non-uniform computatio... / the task modules is called task scheduling as studied in br T. G. Lewis and H. H. Ali. Task Scheduling in Parallel and Distributed
2403.9 An Adaptive Problem-Solving Solution to Large-Scale Scheduling.. - Gratch, al. (1994)(Correct)
Although the general class of most scheduling problems is NP-hard in worst-case complexity,
in practice, domain-specific techniques frequently solve problems in much better than
exponential time. Unfo... / Section describes the scheduling task which involves br an automated solution to this scheduling task is that valid schedules must
2391.6 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
2347.3 Heuristic Algorithms for Scheduling Iterative Task Computations on.. - Tao Yang (1995)(Correct)
Many partitioned scientific programs can be modeled as iterative execution of computational
tasks, represented by iterative task graphs (ITGs). In this paper, we consider the
symbolic scheduling of IT... / - . Ch P. Chretienne Task Scheduling over Distributed Memory br T. G. Lewis and H. H. Ali Task Scheduling in Parallel and Distributed
2339.9 Preemptive Scheduling of Tasks with Reliability Requirements in.. - Oh, Son (1993)(Correct)
Real-time systems are being extensively used in applications that are
mission-critical and life-critical, such as space exploration, aircraft avionics,
and robotics. These mission critical systems are... / system at the level of task scheduling. We consider the problem of br Keywords fault-tolerance task scheduling distributed real-time
2334.4 On Periodic Resource Scheduling for Continuous Media Databases - Garofalakis, Özden, Silberschatz (1998)(Correct)
The Enhanced Pay-Per-View (EPPV) model
for providing continuous media services associates with
each continuous media clip a display frequency that depends
on the clip's popularity. The aim is to inc... / a host of difficult periodic task scheduling problems that fall within the br to complex periodic real-time task scheduling problems Liu and Layland
2327.5 Hardware and Compiler-Directed Cache Coherence in Large-Scale.. - Choi, Yew (1996)(Correct)
In this paper, we study a hardware-supported, compiler-directed (HSCD) cache coherence
scheme, which can be implemented on a large-scale multiprocessor using off-the-shelf microprocessors,
such as the... / locks critical sections and task scheduling. Finally we conclude the
2315.3 On Runtime Parallel Scheduling - Wu (1995)(Correct)
Parallel scheduling is a new approach for load balancing. In parallel scheduling, all
processors cooperate together to schedule work. Parallel scheduling is able to accurately balance
the load by usin... / Collect Load Information Task Scheduling User Phase Task br can provide a low-overhead task scheduling because tasks are packed to
2312.0 Runtime Incremental Parallel Scheduling (RIPS) on Distributed Memory.. - Shu, Wu (1996)(Correct)
Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the under... / Collect Load Information Task Scheduling User Phase Task br state to participate in a task scheduling. The selection policy
2273.0 GAST: A Flexible and Extensible Tool for Evaluating Multiprocessor.. - Jonsson (1998)(Correct)
Automatic tool support for scheduling applications on
multiprocessor platforms is of paramount importance both to
guarantee critical application demands and to keep development
costs down. In this pap... / it becomes difficult to perform task scheduling and resource allocation by br a suite of task assignment task scheduling and resource access
2252.7 The Importance of Locality in Scheduling and Load Balancing for.. - Keckler (1994)(Correct)
This paper addresses the importance of locality when migrating tasks of a parallel program between processors for load balancing in a multiprocessor. Static and preprocessing task scheduling algorithm... / Static and preprocessing task scheduling algorithms work well for br time is kept to a minimum. Task scheduling and load balancing techniques
2226.9 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
2198.7 Compiler and Hardware Support for Cache Coherence in Large-Scale.. - Lynn Choi (1996)(Correct)
In this paper, we study a hardware-supported, compiler-directed (HSCD) cache coherence
scheme which relies mostly on compiler analysis, but which also needs a reasonable amount
of hardware support.
Su... / locks critical sections and task scheduling. Finally we conclude the br by considering more flexible task scheduling model that allows context
2114.1 Multi-dimensional Resource Scheduling for Parallel Queries - Garofalakis, Ioannidis (1996)(Correct)
Scheduling query execution plans is an important component of
query optimization in parallel database systems. The problem is
particularly complex in a shared-nothing execution environment,
where each... / body of work on parallel task scheduling in the field of br in the literature on parallel task scheduling that consider multiple system
2108.4 VITAL Knowledge Representation Language Specification - Motta, Stutt, O'Hara, Kuusela.. (1991)(Correct)
In this document the knowledge representation component of the VITAL workbench is specified. Authors: Enrico Motta, Arthur Stutt, Kieron O'Hara, Juha Kuusela, Hannu Toivonen, Han Reichgelt, Stuart W... / . . . Task Scheduling and task br in the next section. . . . Task Scheduling and task representations
2089.2 Taxonomy of Real-Time Scheduling - Silcock, Kutti(Correct)
In real-time systems, the basic criteria are to satisfy both timeliness and
correctness of real-time solutions. The former requirement is controlled by both resource
and task scheduling at operating s... / by both resource and task scheduling at operating system level br S-C.Evaluation of a Flexible Task Scheduling Algorithm for Distributed
2077.1 High-Performance Incremental Scheduling on Massively Parallel.. - Min-You Wu (1995)(Correct)
Runtime incremental parallel scheduling (RIPS) is a
new approach for load balancing. In parallel scheduling, all
processors cooperate together to balance the workload. Parallel
scheduling accurately b... / Collect Load Information Task Scheduling User Phase Task br A. Gerasoulis. PYRROS Static task scheduling and code generation for
2076.2 Task Scheduling using Block Dependency DAG of Block-Oriented Sparse.. - Lee, Kim, Hong, Lee(Correct)
The block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular
sub-blocks, and handles each block as a computational unit in order to increase
data reuse in a hierarchica... / Task Scheduling using Block Dependency DAG of br model we also propose a new task scheduling algorithm using block
2075.4 From Timed to Hybrid Systems - Maler, Manna, Pnueli (1992)(Correct)
We propose a framework for the formal specification and verification of timed and
hybrid systems. For timed systems we propose a specification language that refers
to time only through age functio... / as well as the phenomena of task scheduling according to time and
2045.2 Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors.. - Yu-Kwong Kwok And(Correct)
Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to
minimize the overall execution time of the program by properly assigning the nodes of the graph to t... / Chung Optimal Multiprocessor Task Scheduling Using Dominance and br Comparison of Algorithms for Scheduling Task Graphs on Parallel
2042.2 Dynamic Critical-Path Scheduling: An Effective Technique for.. - Kwok, Ahmad (1996)(Correct)
In this paper, we propose a static scheduling algorithm for allocating task graphs to fullyconnected
multiprocessors. We discuss six recently reported scheduling algorithms and show
that they possess ... / Study of the Performance of a Task Scheduling Algorithm IEEE Trans. on br Allocation Parallel Scheduling Task Graphs. . This research
2014.6 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
2011.2 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
1973.0 Incorporating Load Factor into the Scheduling of Soft Real-Time.. - Chakravarthy, Hong, Johnson (1994)(Correct)
In real-time databases (as opposed to real-time systems), transactions must satisfy the ACID
properties in addition to satisfying the timing constraints specified for each transaction (or
task). EDF-H... / scheduling more difficult than task scheduling in real-time systems. br area has been the problem of scheduling tasks to meet the timing
1938.8 A Framework for Generating Group-Parallel Programs - Ursula Fissgus, Thomas Rauber.. (1998)(Correct)
We consider the generation of mixed task and data
parallel programs and discuss how a clear separation
of task and data parallelism can support the development
of efficient programs. The separation be... / and how design decisions like task scheduling and data distribution can be br should be exploited task scheduling and how many of the
1918.9 Compiler Analysis for Cache Coherence: Interprocedural Array.. - Choi, Yew (1996)(Correct)
In this paper, we present compiler algorithms for detecting references to stale data in sharedmemory
multiprocessors. The algorithm consists of two key analysis techniques, stale reference
detection a... / that because of the dynamic task scheduling at each epoch boundary a
1878.3 Optimistic Real-Time Simulation - Ghosh, Fujimoto, Schwan (1995)(Correct)
On-line simulations play a critical role in understanding, supervising, and controlling large-scale
systems. For instance, in military training applications, users are presented with complex scenarios... / For example concerning task scheduling researchers are now moving
1878.3 A Case Study on Parallel Synchronous Implementations for Tabu Search.. - Celso Ribeiro (1996)(Correct)
We study in this paper different synchronous strategies for the parallel implementation of
tabu search on a parallel machine. The task scheduling problem on heterogeneous processors
under precedenc... / on a parallel machine. The task scheduling problem on heterogeneous br and compared. Keywords Task scheduling tabu search parallel
1864.9 Architectural And Software Support For Executing Numerical.. - Anik (1993)(Correct)
Numerical applications require large amounts of computing power. Although shared
memory multiprocessors provide a cost-effective platform for parallel execution of numerical
programs, parallel process... / for lock access and parallel task scheduling are proposed. iv The br . An Efficient Task Scheduling Algorithm
1864.6 An Automatic Approach to Specializing System Components - Volanschi (1998)(Correct)
Introduction
Adaptability is increasingly becoming a critical feature of modern operating systems. This
feature must cope with some fundamental requirements such as:
ffl keeping up with the evolutio... / Likewise generic policies for task scheduling are not well suited for
1852.7 Application-Driven Synthesis of Core-Based Systems - Ms(Correct)
The trend of integrating systems on chip using programmable and application specific cores has
become predominant in the development of modern application specific systems. Due to the increasing
popul... /
1848.8 Design and Implementation of Statistical Rate Monotonic Scheduling in .. - Atlas, Bestavros (1998)(Correct)
Statistical Rate Monotonic Scheduling (SRMS) is a generalization
of the classical RMS results of Liu and Layland
[LL73] for periodic tasks with highly variable execution
times and statistical QoS requ... / interface API for periodic task scheduling using SRMS on KURT Linux. We br Spr B. Sprunt. Aperiodic task scheduling for realtime systems. PhD
1844.9 : Real-Time Objects and Atomicity for Multiprocessors - Ahmed Gheith(Correct)
lications," by Ahmed Gheith
and Karsten Schwan, which appeared in ACM Transactions on Computer Systems, vol.
11, no. 1, pp. 33--72, February 1993, c fl1993, Association for Computing Machinery, Inc.
... / dynamic concurrency control and task scheduling policies offered by br and J.A. Stankovic. Dynamic task scheduling in hard realtime distributed
1820.5 System Support for Robust, Collaborative Applications - Chelliah, Ahamad(Correct)
Traditional transaction models ensure robustness for distributed applications through the
properties of view and failure atomicity. It has generally been felt that such atomicity properties
are restri... / maintain a diary object. The scheduling task is performed by a br of the room. If the scheduling task with the many negotiation
1819.3 Formal Design and Verification of a Reliable Computing Platform For.. - Butler, Di Vito (1992)(Correct)
In this paper the design and formal verification of the Reliable Computing Platform
(RCP), a fault-tolerant computing system for digital flight control applications,
are presented. The RCP utilizes NM... / . Task Scheduling and Voting br drastically in the types of task scheduling that are utilized as well as
1804.4 A Coarse-Grain Parallel Formulation of Multilevel k-way . . . - Karypis, al. (1997)(Correct)
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly
suited for message-passing libraries that have high latency. The multilevel k-w... / operation research and task scheduling. The problem is to partition
1804.1 An Empirical Approach to Temporal Reference Resolution - Wiebe, O'Hara, Öhrström-Sandgren.. (1998)(Correct)
Scheduling dialogs, during which people negotiate the times of appointments, are common
in everyday life. This paper reports the results of an in-depth empirical investigation
of resolving explicit te... / or stray significantly from the scheduling task. To support the br off the main topic and scheduling task indicated as Yes in column
1799.0 Predictability and Consistency in Real-Time Database Systems - Kim, Son (1993)(Correct)
Introduction
As our society becomes more integrated with computer technology, information
processing for human activities necessitates computing that responds to requests in
real-time rather than ju... / are controlled. In real-time task scheduling it is usually assumed that br B. Sprunt. Aperiodic Task Scheduling for Real-Time Systems. Ph.D.
1790.7 Workflow Applications to Research Agenda: Scalable and Dynamic Work.. - Sheth (1997)(Correct)
this paper, we focus
on two issues. The first issue relates to the challenges that could be addressed
by evolving the current workflow technology. Two of the challenges to which
we focus our attention... / inter-task dependencies task scheduling workflow data management br participating in the scheduling and task activation are task
1765.7 Scheduling Hard Real-Time Tasks with 1-Processor-Fault-Tolerance - Oh, Son (1993)(Correct)
Real-time systems are being extensively used in applications that are
mission-critical and life-critical, such as space exploration, aircraft avionics,
and robotics. Since these systems are usually op... / in a system at the level of task scheduling. Traditional approaches to br problem at the level of task scheduling and systematically study the
1756.7 On Symbolic Scheduling and Parallel Complexity of Loops - Tao Yang(Correct)
In this paper, we first consider the symbolic scheduling
and performance prediction of a partitioned single
loop on message-passing architectures with nonzero
communication and a sufficient number of ... / cost. The previous work on task scheduling and performance prediction br A. Gerasoulis PYRROS Static Task Scheduling and Code Generation for
1743.2 Feedback-Enhanced Optimization of Static Scheduling for Parallel.. - Dietz, Braun, Scheetz, Casavant.. (1995)(Correct)
Current static parallel optimization techniques rarely try to account for either code
block run-time durations or communication latencies. This paper introduces a new
static compiler optimization tech... / grain size determination and task scheduling. We focus our attention on br Thus not only is parallel task scheduling important it is an integral
1734.5 Multilevel k-way Partitioning Scheme for Irregular Graphs - Karypis, Kumar (1998)(Correct)
In this paper we present and study a class of graph partitioning algorithms that reduce the size of the graph by
collapsing vertices and edges, find a k-way partitioning of the smaller graph, and then... / parallel scientific computing task scheduling and VLSI design. Some
1734.3 Integrating Software Pipelining and Graph Scheduling for Iterative.. - Cong Fu (1995)(Correct)
Graph scheduling has been shown effective for solving irregular
problems represented as directed acyclic graphs(DAGs) on distributed
memory systems. Many scientific applications can also be modeled ... / . . P. Chretienne Task Scheduling over Distributed Memory br A. Gerasoulis PYRROS Static Task Scheduling and Code Generation for
1730.2 The Impact of Parallel Loop Scheduling Strategies on Prefetching in a .. - David Lilja (1994)(Correct)
Trace-driven simulations of numerical Fortran programs are used to study the impact of the parallel
loop scheduling strategy on data prefetching in a shared memory multiprocessor with private data
cac... / consideration how the parallel task scheduling strategy interacts with the br memory delay but the parallel task scheduling strategy can interact
1722.1 Concurrency Control Algorithms for Real-Time Database Systems - Lee (1994)(Correct)
In addition to satisfying data consistency requirements as in conventional database systems, concurrency control in real-time database systems must also satisfy timing constraints, such as deadlines a... / to those used in real-time task scheduling many restrictions have to be br CPU scheduling as in real-time task scheduling. The problem of task
1701.2 Designing Communication Strategies for Heterogeneous Parallel Systems - Prakash, Panda(Correct)
This paper investigates communication strategies for interconnecting heterogeneous parallel
systems. As the speed of processors and parallel systems keep on increasing over the years, electronic
inter... / . Task Scheduling Strategy br the programming model task scheduling strategies application
1701.0 On The Granularity And Clustering Of Directed Acyclic Task Graphs - Gerasoulis, Yang (1990)(Correct)
Clustering has been used as a compile time pre-processing step in the scheduling of task
graphs on parallel architectures. A special case of the clustering problem arises in scheduling
an unbounded nu... / granularity partitioning task scheduling. Introduction In this br . Ph. Chretienne Task Scheduling over Distributed Memory
1699.7 Handling Control - Sitaram (1993)(Correct)
Non-local control transfer and exception handling have
a long tradition in higher-order programming languages
such as Common Lisp, Scheme and ML. However, each
language stops short of providing a full... /
1696.6 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
1695.8 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
1688.6 Enhanced Analysis of Cache-related Preemption Delay in Fixed-priority .. - Lee, Hahn, Kim (1997)(Correct)
We propose an enhanced technique for analyzing and
thus, bounding cache-related preemption delay in fixedpriority
preemptive scheduling focusing on instruction
caching. The proposed technique improves... / focus on practical aspects of task scheduling In addition br for Implementing Objects and Scheduling Tasks in Lock-Free RealTime
1679.4 PYRROS: Static Task Scheduling and Code Generation for Message.. - Yang, Gerasoulis (1992)(Correct)
We describe a parallel programming tool for scheduling static task graphs and generating the appropriate target code for message passing MIMD architectures. The computational complexity of the system ... / PYRROS Static Task Scheduling and Code Generation for br . Ph. Chretienne Task Scheduling over Distributed Memory
1675.7 A Layered Architecture for Office Delivery Robots - Simmons, Goodwin, Haigh, Koenig.. (1997)(Correct)
Office delivery robots have to perform many tasks.
They have to determine the order in which to visit offices,
plan paths to those offices, follow paths reliably,
and avoid static and dynamic obstacle... / navigation path planning and task scheduling. The layers are independent br Navigation Path Planning Task Scheduling Decision-Theoretic
1666.1 Parallel Implementation - Gautier, Hong, Roch, Schreiner(Correct)
of some characteristics of softwares for parallel computer algebra.
SBSH means Sugarbush. PCLBSTM means PACLIB/STURM and PCGVR
PAC/GIVARO.
Conclusions. Major problems that appears in the design and ... / and their grain sizes thus task scheduling is a critical point to reach br and T. Yang. PYRROS Static Task Scheduling and Code Generation for
1665.4 Scheduling DAGs on a Bounded Number of Processors - Zhou (1996)(Correct)
A new DAG scheduling algorithm named Reverse Clustering
has been introduced in this paper. The load balancing problem
has been handled in this approach in a more natural way than
the edge-zeroing bas... / technique. Keywords Task scheduling Multistage method br allocation task assignment task scheduling list scheduling clustering
1656.0 A Fast Recursive Mapping Algorithm - Song Chen(Correct)
This paper presents a generic technique for mapping parallel algorithms onto parallel architectures. The
proposed technique is a fast recursive mapping algorithm which is a component of the Cluster-M ... / the task modules is called task scheduling If the task graphs to br T. G. Lewis and H. H. Ali. Task Scheduling in Parallel and Distributed
1655.9 Sequentialization Of Parallel Logic Programs With Mode Analysis - Massey (1992)(Correct)
The family of concurrent logic programming languages based on Flat-Guarded Horn
Clauses has proven to be a great asset to programmers seeking to quickly construct efficient
programs for highly paralle... / include dependent goals task scheduling overhead and the costs of
1638.6 Balancing Robustness and Efficiency in Unification-augmented.. - Rosé, Lavie(Correct)
Large practical NLP applications require robust analysis components that can effectively
handle input that is disfluent or extra-grammatical. The effectiveness and efficiency of any robust
parser are ... / ESST English Spontaneous Scheduling Task domain. Introduction br ESST English Spontaneous Scheduling Task domain. We begin with a
1638.0 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
1624.4 Analyzing Asynchronous Pipeline Schedules - Donaldson, Ferrante (1997)(Correct)
Asynchronous pipelining is a form of parallelism which may be used in distributed memory systems.
An asynchronous pipeline schedule is a generalization of a noniterative DAG schedule. Accurate estimat... / pipelining loop optimization task scheduling distributed memory
1616.2 Aperiodic Task Scheduling for Real-Time Systems - Sprunt (1990)(Correct)
This thesis develops the Sporadic Server (SS) algorithm for scheduling aperiodic tasks in real-time
systems. The SS algorithm is an extension of the rate monotonic algorithm which was designed to
sche... / Aperiodic Task Scheduling for Real-Time Systems br on the FuturebusAperiodic Task Scheduling for RT Systems
1595.5 Theoretical and Experimental Analysis of Selective Fault-Tolerant.. - Nicole Marie(Correct)
An increasing number of applications are demanding real-time performance
from their multiprocessor systems. For many of these applications,
a failure may produce disastrous results. Such failures are ... / freed from differences in local task scheduling and will schedule br considered only independent task scheduling. Most real-world
1593.4 On RAM priority queues - Thorup (1996)(Correct)
Priority queues are some of the most fundamental data
structures. They are used directly for, say, task scheduling
in operating systems. Moreover, they are essential to greedy
algorithms. We study the... / are used directly for say task scheduling in operating systems.
1585.0 Memory-Adaptive External Sorting - Pang, Carey, Livny (1993)(Correct)
In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large
relations may fluctuate due to contention from other higher-priority transactions. Thi... /
1585.0 Performance Prediction in Symbolic Scheduling of Partitioned Programs .. - Tao Yang(Correct)
In this paper we consider the symbolic scheduling of partitioned loop programs which are
modeled as iterative task graphs (ITGs). Each task in such a graph is coarse grained and
contains a large chunk... / as demonstrated in task scheduling based on directed acyclic br A. Gerasoulis PYRROS Static Task Scheduling and Code Generation for
1574.2 Processor Allocation and Task Scheduling of Matrix Chain Products on.. - Heejo Lee(Correct)
The problem of finding an optimal product sequence for sequential multiplication of a
chain of matrices (the matrix chain ordering problem, MCOP) is well-known and has been
studied for a long time. In... / Processor Allocation and Task Scheduling of Matrix Chain Products on br -Processor allocation task scheduling matrix chain product
1570.4 Scheduling to Reduce Memory Coherence Overhead on Coarse-Grain.. - Connelly, Ellis (1995)(Correct)
Some Distributed Shared Memory (DSM) and Cache-Only Memory
Architecture (COMA) multiprocessors keep processes near the data they
reference by transparently replicating remote data in the processes' lo... / We examine the effect of task scheduling on data replication and br or programmer hints for task scheduling may be embedded in an
1568.1 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
1561.8 The DUDE Runtime System: An Object-Oriented Macro-Dataflow Approach.. - Grunwald, Vajracharya (1995)(Correct)
Modern parallel programming languages allow programmers to specify parallelism using
implicitly parallel constructs such as data parallel or object parallel methods, and explicitly
parallel constructs... / both loop-level scheduling and task scheduling. Our runtime system is br to perform both loop-level scheduling and task scheduling. Our runtime
1536.5 Task Scheduling in Networks - Phillips, Stein, Wein (1996)(Correct)
Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic
problem in computer science and operations research. Most of the research on this problem
incorporates th... / Task Scheduling in Networks Cynthia
1532.5 On the Accuracy of Compile-time Performance Prediction - van Gemund (1995)(Correct)
Recently, a static technique was presented that yields
low-cost, symbolic performance models of parallel systems,
intended for crude scalability analysis as well as
first-order system design. The appr... / in the context of dynamic task scheduling. However in neither case
1493.1 Parallelization of an Interior Point Algorithm for Linear Programming - Simitci (1994)(Correct)
PARALLELIZATION OF
AN INTERIOR POINT ALGORITHM
FOR LINEAR PROGRAMMING
Huseyin Simit¸ci
M.S. in Computer Engineering and Information Science
Supervisor: Asst. Prof. Cevdet Aykanat
July 1994
In this stu... / . Task Scheduling Algorithm. br are generated. The final task scheduling algorithm is shown in Figs.
1492.9 Including Selective Fault-Tolerance in Real-Time Multiprocessor.. - Nicole Marie (1994)(Correct)
An increasing number of applications are demanding real-time performance
from their multiprocessor systems. For many of these applications, a failure
may produce disastrous results. However, the area ... / freed from differences in local task scheduling and will schedule br A Bottom-Up Approach to Task Scheduling on Distributed Memory
1491.2 Advanced Gain-Scheduling Techniques For Uncertain Systems - Pierre Apkarian (1997)(Correct)
This paper is concerned with the design of gain-scheduled controllers for uncertain Linear ParameterVarying
systems. Two alternative design techniques for constructing such controllers are discussed.
... / all components of the gain-scheduling task from theoretical
1490.8 Constructing Distributed Schedulers Using the - Messiahs Interface(Correct)
The messiahs project is investigating mechanisms
that support task placement in heterogeneous, distributed,
autonomous systems. messiahs provides a
substrate on which scheduling algorithms can be impl... / utilization of such systems is task scheduling. Task scheduling has two br systems is task scheduling. Task scheduling has two components
1484.3 Support for Implementation of Evolutionary Concurrent Systems in.. - Pandey, Browne(Correct)
In many concurrent programming languages, concurrent programs
are difficult to extend and modify: small changes in a concurrent
program may require re-implementations of a large number of its compon... / and distributions and task scheduling algorithms. We show that br In addition synchronization task scheduling data mapping and data
1482.0 Support for Implementing Scheduling Algorithms Using Messiahs - Chapin, Spafford (1994)(Correct)
The messiahs project is investigating mechanisms that support task placement in heterogeneous,
distributed, autonomous systems. messiahs provides a substrate on which scheduling
algorithms can be impl... / utilization of such systems is task scheduling. Task scheduling has two br systems is task scheduling. Task scheduling has two components