Arpaci-Dusseau AC, Culler DE, Mainwaring AM. Scheduling with implicit information in distributed systems. Proceedings of the SIGMETRICS'98/PERFORMANCE'98 Joint Conference on the Measurement and Modeling of Computer Systems, Madison, WI, June 1998. ACM Press: New York, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Synchronous Queuing: A Co-Allocation Mechanism - For Multimedia Enabled (Correct)
....of the drawbacks is that this model does not allow over subscription of the resources, which could potentially cause under utilization of the overall system. Another drawback is that the advance reservationbased approach imposes strict timing constraints on the client side. Implicit co scheduling [1] is a new time sharing approach for scheduling parallel applications that uses the communication and synchronization that occur naturally within the application to coordinate scheduling across workstations. Here, two events response time and message arrival are used to decide whether to continue ....
A. C. Arpaci-Dusseau, D. E. Culler, and A. M. Mainwaring, "Scheduling with implicit information in distributed systems," SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, June 1998, pp. 233-243.
Symbiotic Jobscheduling with Priorities for a.. - Snavely, Tullsen.. (2002) (3 citations) (Correct)
....massively parallel system which largely protects threads from each other. Thus, while the scale of the scheduling problem is great, the number of factors determining how threads interact are few and relatively straight forward. Sobalvarro and Weihl [26] Gupta, et al. 11] and Dusseau, et al. [4] all explore the benefits of coscheduling parallel jobs based on their communication patterns. In fact, a multiprocessor scheduler should solve a similar problem how to coschedule threads on different processors to maximize efficiency in the face of bottlenecks on shared system resource (such ....
A.C. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In Sigmetrics, 1998.
Symbiotic Jobscheduling with Priorities for a.. - Snavely, Tullsen.. (2002) (3 citations) (Correct)
....massively parallel system which largely protects threads from each other. Thus, while the scale of the scheduling problem is great, the number of factors determining how threads interact are few and relatively straight forward. Sobalvarro and Weihl [27] Gupta, et al. 11] and Dusseau, et al. [4] all explore the benefits of coscheduling parallel jobs based on their communication patterns. In fact, a multiprocessor scheduler should solve a similar problem how to coschedule threads on different processors to maximize efficiency in the face of bottlenecks on shared system resource (such ....
A. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In Sigmetrics, 1998.
Modeling and Analysis of Dynamic Coscheduling in.. - Squillante, Zhang, .. (2002) (1 citation) (Correct)
....NT. When a task initiates an I O operation, it relinquishes the CPU, and is put in a blocked state. Upon I O completion, it typically receives a priority boost and is scheduled again. 2. 2 Spin Block (SB) Versions of this mechanism have been considered in the context of implicit coscheduling [5, 2] and demand based coscheduling [19] In this scheme, a task spins on a message receive for a fixed amount of time (spin time) before blocking itself. The rationale here is that if the message arrives in a reasonable amount of time (spin time) the sender task is also currently scheduled and the ....
A.C. Arpaci-Dusseau, D.E. Culler, A.M. Mainwaring. Scheduling with implicit information in distributed systems. Proceedings of ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, 1998.
Loosely Coordinated Coscheduling In The Context Of . . . - Sodan (2005) (Correct)
No context found.
Arpaci-Dusseau AC, Culler DE, Mainwaring AM. Scheduling with implicit information in distributed systems. Proceedings of the SIGMETRICS'98/PERFORMANCE'98 Joint Conference on the Measurement and Modeling of Computer Systems, Madison, WI, June 1998. ACM Press: New York, 1998.
Resource Allocation in Federated Distributed - Computing Infrastructures Alvin (Correct)
No context found.
A. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In Proceedings of the 1998.
Resource Allocation in Federated Distributed.. - AuYoung, Chun.. (2004) (Correct)
No context found.
A. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In Proceedings of the 1998.
Inter-program Compilation for Disk Energy - Reduction Jerry Hom (Correct)
No context found.
Arpaci-Dusseau, A., Culler, D., Mainwaring, A.: Scheduling with implicit information in distributed systems. In: Proceedings of the Conference on Measurement and Modeling of Computer Systems. (1998) 233--243
Performance Estimation for Scheduling on Shared Networks - Shreenivasa Venkataramaiah .. (Correct)
No context found.
A. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In SIGMETRICS ' 98/PERFORMANCE' 98 Joint Conference on the Measurement and Modeling of Computer Systems, June 1998.
An Energy-Based Implicit Co-scheduling Model for Beowulf .. - Somsak Sriprayoonsakul.. (Correct)
No context found.
A. C. Arpaci-Dusseau, D. E. Culler, and A. M. Mainwaring. Scheduling with implicit information in distributed systems. In Proceedings of ACM SIGMETRICS, 1998.
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