(Enter summary)
Abstract: Buffered coscheduling is a scheduling methodology for
time-sharing communicating processes in parallel and distributed
systems. The methodology has two primary features:
communication buffering and strobing. With communication
buffering, communication generated by each processor
is buffered and performed at the end of regular intervals
to amortize communication and scheduling overhead.
This infrastructure is then leveraged by a strobing mechanism
to perform a total exchange of information at... (Update)
Context of citations to this paper: More
...FCS. One idea that has not yet been implemented is to use dynamic spinning times for synchronization. We are also planning to implement BCS [12] on top of STORM, and compare the performance and benefits of FCS relative to BCS. In addition, we plan to execute more tests with more...
...addressed in this study. Finally, scheduling parallel computations on batch parallel systems has attracted considerable attention [3, 6, 13, 10]. The usual metric to be optimized here is global batch throughput. However, Subholk at al. 13] proposes strategies to minimize...
Cited by: More
Loosely Coordinated Coscheduling In The Context Of . . . - Sodan (2005)
(Correct)
Parallel Job Scheduling - A Status Report - Feitelson, Rudolph, al. (2004)
(Correct)
An Energy-Based Implicit Co-scheduling Model for Beowulf .. - Somsak Sriprayoonsakul..
(Correct)
Similar documents (at the sentence level): More
15.3%: Improved Resource Utilization with Buered Coscheduling - Petrini, Feng
(Correct)
13.8%: Scheduling with Global Information in Distributed Systems - Petrini, Feng (2000)
(Correct)
10.9%: Efficient Scheduling of Parallel Jobs on Massively Parallel.. - Fabrizio Petrini And
(Correct)
Active bibliography (related documents): More All
0.3: Scheduler Testbed System Design - Frachtenberg, Petrini
(Correct)
0.2: Tolère Stage Report - Pinello
(Correct)
0.2: Scaling to Thousands of Processors with - Buffered Coscheduling Fabrizio
(Correct)
Similar documents based on text: More All
0.3: Scheduling on AP/Linux for Fine and Coarse Grain Parallel.. - Kuniyasu Suzaki David (1999)
(Correct)
0.2: Dynamic Coscheduling on Workstation Clusters - Patrick Sobalvarro (1998)
(Correct)
Related documents from co-citation: More All
4: Dynamic coscheduling on workstation clusters
- Pakin, Weihl - 1998
3: The interaction of parallel and sequential workloads on a network of workstation..
- Arpaci, Dusseau et al. - 1995
3: Scheduling Techniques for Concurrent Systems (context) - Ousterhout - 1982
BibTeX entry: (Update)
F. Petrini and W. Feng. Buffered coscheduling: A new methodology for multitasking parallel jobs on distributed systems. In Proceedings of the Int'l Parallel and Distributed Processing Symposium 2000, IPDPS2000, May 2000. http://citeseer.ist.psu.edu/petrini00buffered.html More
@inproceedings{ petrinibuffered,
author = "F. Petrini and W.-c. Feng",
title = "Buffered Coscheduling: {A} New Methodology for Multitasking Parallel Jobs on Distributed Systems",
pages = "439--444",
url = "citeseer.ist.psu.edu/petrini00buffered.html" }
Citations (may not include all citations):
609
Myrinet: A Gigabitper -Second Local Area Network
- Boden, Cohen et al. - 1995
126
The Impact of Operating System Scheduling Policies and Synch.. (context) - Gupta, Tucker et al. - 1991
80
Effective Distributed Scheduling of Parallel Workloads
- Dusseau, Arpaci et al. - 1996
74
Improved Utilization and Responsiveness with Gang Scheduling
- Feitelson, Jette - 1997
68
Demand-Based Coscheduling of Parallel Jobs on Multiprogramme..
- Sobalvarro, Weihl - 1995
64
User-Level Network Interface Protocols (context) - Bhoedjang, Ruhl et al. - 1998
40
Dynamic Coscheduling on Workstation Clusters
- Sobalvarro, Pakin et al. - 1998
32
IEEE Transactions on Parallel and Distributed Systems (context) - Gupta, Kumar et al. - 1993
29
Scheduling with Implicit Information in Distributed Systems (context) - Arpaci-Dusseau, Culler et al. - 1998
27
SMART: a Simulator of Massive ARchitectures and Topologies
- Petrini, Vanneschi - 1997
23
for Gang Scheduled Workloads (context) - Lee, Frank et al. - 1997
22
Performance Characteristics of Gang Scheduling in Multiprogr..
- Jette - 1997
14
A Closer Look At Coscheduling Approaches for a Network of Wo.. (context) - Nagar, Banerjee et al. - 1999
11
Scalability Analysis of Multidimensional Wavefront Algorithm.. (context) - Hoisie, Lubeck et al. - 1999
5
Scheduling with Global Information in Distributed Systems
- Petrini, Feng - 2000
5
Network Performance with Distributed Memory Scientific Appli..
- Petrini - 1998
2
Implementing the Combination of Time Sharing and Space Shari..
- Suzaki, Walsh - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://public.lanl.gov/feng/research/bcs.html):
Efficient Scheduling of Parallel Jobs on Massively Parallel.. - Fabrizio Petrini And
(Correct)
Scheduling with Global Information in Distributed Systems - Petrini, Feng (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC