• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,542
Next 10 →

Abstract GLOBAL STATIC-PRIORITY SCHEDULING OF SPORADIC TASK SYSTEMS ON MULTIPROCESSOR PLATFORMS

by unknown authors
"... The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadi ..."
Abstract - Add to MetaCart
for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Resource-augmentation bounds are provided that quantify the tightness of these schedulability tests. Keywords: Multiprocessor platforms; Static-Priority Scheduling; Schedulability analysis; Resource

Fault-tolerant deadline-monotonic algorithm for scheduling hard real-time tasks

by Alan A. Bertossi, Luigi Vincenzo Mancini, Andrea Fusiello - In Proceedings of the 11th International Parallel Processing Symposium , 1997
"... This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a multiprocessor system. Fault-tolerance is achieved by using a combined duplication technique where each task scheduled on ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a multiprocessor system. Fault-tolerance is achieved by using a combined duplication technique where each task scheduled

real-time scheduling: the deadline-monotonic approach

by N. C. Audsley, A. Burns, M. F. Richardson, A. J. Wellings - in Proc. IEEE Workshop on Real-Time Operating Systems and Software , 1991
"... ABSTRACT. The scheduling of processes to meet deadlines is a difficult problem often simplified by placing severe restrictions upon the timing characteristics of individual processes. One restriction often introduced is that processes must have deadline equal to period. This paper investigates sched ..."
Abstract - Cited by 39 (1 self) - Add to MetaCart
approaches and associated schedulability tests, the deadline-monotonic approach is introduced. New schedulability tests are derived which vary in computational complexity. The tests are shown to be directly applicable to the scheduling of sporadic processes.

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 3756 (3 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 501 (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

Earthquake Shakes Twitter Users: Real-time Event Detection by Social Sensors

by Takeshi Sakaki, Makoto Okazaki, Yutaka Matsuo - In Proceedings of the Nineteenth International WWW Conference (WWW2010). ACM , 2010
"... Twitter, a popular microblogging service, has received much attention recently. An important characteristic of Twitter is its real-time nature. For example, when an earthquake occurs, people make many Twitter posts (tweets) related to the earthquake, which enables detection of earthquake occurrence ..."
Abstract - Cited by 524 (4 self) - Add to MetaCart
Twitter, a popular microblogging service, has received much attention recently. An important characteristic of Twitter is its real-time nature. For example, when an earthquake occurs, people make many Twitter posts (tweets) related to the earthquake, which enables detection of earthquake occurrence

Scheduling Multithreaded Computations by Work Stealing

by Robert D. Blumofe , Charles E. Leiserson , 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal com ..."
Abstract - Cited by 568 (34 self) - Add to MetaCart
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal

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 598 (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

CoolStreaming/DONet: A Data-driven Overlay Network for Peer-to-Peer Live Media Streaming

by Xinyan Zhang, Jiangchuan Liu, Bo Li, Tak-shing Peter Yum - in IEEE Infocom , 2005
"... This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availability information with a set of partners, and retrieves unavailable data from one or more partners, or supplies available dat ..."
Abstract - Cited by 475 (42 self) - Add to MetaCart
management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents.

An Efficient k-Means Clustering Algorithm: Analysis and Implementation

by Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman, Angela Y. Wu , 2000
"... K-means clustering is a very popular clustering technique, which is used in numerous applications. Given a set of n data points in R d and an integer k, the problem is to determine a set of k points R d , called centers, so as to minimize the mean squared distance from each data point to its ..."
Abstract - Cited by 417 (4 self) - Add to MetaCart
nearest center. A popular heuristic for k-means clustering is Lloyd's algorithm. In this paper we present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is very easy to implement. It differs from most other
Next 10 →
Results 1 - 10 of 5,542
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University