• 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 4,666
Next 10 →

A New Fault-Tolerant Technique for Improving Schedulability in Multiprocessor Real-time Systems

by R. Al-omari, Arun K. Somani, G. Manimaran - In Proc. Intl. Parallel and Distributed Processing Symposium (IPDPS , 2001
"... In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two differen ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
that of BB-overloading, and offers reliability comparable to that of BB-overloading. The proposed PBoverloading is a general technique that can be employed in any static or dynamic fault-tolerant scheduling algorithm.

Scheduling for reduced CPU energy

by Mark Weiser, Brent Welch, Alan Demers, Scott Shenker - USENIX SYMP. OPERATING , 1994
"... The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by displays and disks has been studied elsewhere; this paper considers a new method for reducing the energ ..."
Abstract - Cited by 563 (2 self) - Add to MetaCart
1994]. What are the right scheduling algorithms for taking advantage of reduced clock-speed, especially in the presence of applications demanding ever more instructions-per-second? We consider several methods for varying the clock speed dynamically under control of the operating system, and examine

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

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 546 (18 self) - Add to MetaCart
alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group

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
life. Dynamic Voltage Scaling (DVS) has been a key technique in exploiting the hardware characteristics of processors to reduce energy dissipation by lowering the supply voltage and operating frequency. The DVS algorithms are shown to be able to make dramatic energy savings while providing

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.

Dynamic Fault-Tolerant Clock Synchronization

by Danny Dolev, Joseph Y. Halpern, Barbara Simons, Ray Strong , 1996
"... This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. Assuming a fault tolerant authentication protocol, the algorithms tolerate both link and processor fa ..."
Abstract - Cited by 142 (9 self) - Add to MetaCart
This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. Assuming a fault tolerant authentication protocol, the algorithms tolerate both link and processor

GSAT and Dynamic Backtracking

by Matthew L. Ginsberg, David A. McAllester - Journal of Artificial Intelligence Research , 1994
"... There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new te ..."
Abstract - Cited by 386 (15 self) - Add to MetaCart
technique that combines these two approaches. The algorithm allows substantial freedom of movement in the search space but enough information is retained to ensure the systematicity of the resulting analysis. Bounds are given for the size of the justification database and conditions are presented

A New Study for Fault-tolerant Real-time Dynamic Scheduling Algorithms

by G. Manimaran , C. Siva Ram Murthy - THIRD INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING (HIPC '96), DECEMBER 19 - 22 , 1996
"... Many time-critical applications require predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. Failures can happen either due to processor faults or due to task errors. To tolerate both processor and task failures, the copies of ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
crucial parameter which affects the performance of any fault-tolerant dynamic scheduling algorithm. To study the effect of distance parameter, we make fault-tolerant extensions to the well-known myopic scheduling algorithm [3] which is a dynamic scheduling algorithm capable of handling resource

The impact of imperfect scheduling on cross-layer congestion control in wireless networks

by Xiaojun Lin, Ness B. Shroff , 2005
"... In this paper, we study cross-layer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal cross-layer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract - Cited by 349 (32 self) - Add to MetaCart
-layer congestion control will be impacted if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study both the case when the number of users in the system is fixed and the case with dynamic arrivals and departures of the users, and we establish
Next 10 →
Results 1 - 10 of 4,666
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