Results 1 - 10 of 199,105

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

by C.L. Liu, James Layland , 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract - Cited by 3712 (2 self) - Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...

Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems

by Padmanabhan Pillai, Kang G. Shin , 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract - Cited by 498 (4 self) - Add to MetaCart
importance, is largely overlooked/under-developed. To provide real-time guarantees, DVS must consider deadlines and periodicity of real-time tasks, requiring integration with the real-time scheduler. In this paper, we present a class of novel algorithms called real-time DVS (RT-DVS) that modify the OS

Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor

by Sanjoy K. Baruah, Aloysius K. Mok, Louis E. Rosier - In Proceedings of the 11th Real-Time Systems Symposium , 1990
"... In this paper, we consider the preemptivescheduling of hard-real-time sporadic task systems on one processor. Wefirstgive necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P = NP). They ..."
Abstract - Cited by 228 (36 self) - Add to MetaCart
In this paper, we consider the preemptivescheduling of hard-real-time sporadic task systems on one processor. Wefirstgive necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P = NP

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

by Edward Ashford Lee, David G. Messerschmitt - IEEE TRANSACTIONS ON COMPUTERS , 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract - Cited by 592 (37 self) - Add to MetaCart
special case of Petri nets. This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple proces-sors. A class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single

A scheduling model for reduced CPU energy

by Frances Yao, Alan Demers, Scott Shenker - ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE , 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract - Cited by 550 (3 self) - Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give

Planning Algorithms

by Steven M LaValle , 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract - Cited by 1108 (51 self) - Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning

Bro: A System for Detecting Network Intruders in Real-Time

by Vern Paxson , 1999
"... We describe Bro, a stand-alone system for detecting network intruders in real-time by passively monitoring a network link over which the intruder's traffic transits. We give an overview of the system's design, which emphasizes highspeed (FDDI-rate) monitoring, real-time notification, clear ..."
Abstract - Cited by 903 (41 self) - Add to MetaCart
We describe Bro, a stand-alone system for detecting network intruders in real-time by passively monitoring a network link over which the intruder's traffic transits. We give an overview of the system's design, which emphasizes highspeed (FDDI-rate) monitoring, real-time notification

Software pipelining: An effective scheduling technique for VLIW machines

by Monica Lam , 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract - Cited by 579 (3 self) - Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software

Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism

by David D. Clark, Scott Shenker, Lixia Zhang , 1992
"... This paper considers the support of real-time applications in an ..."
Abstract - Cited by 575 (25 self) - Add to MetaCart
This paper considers the support of real-time applications in an

A learning algorithm for Boltzmann machines

by H. Ackley, E. Hinton, J. Sejnowski - Cognitive Science , 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract - Cited by 586 (13 self) - Add to MetaCart
The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a
Results 1 - 10 of 199,105