| R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, Y. C. E. Zhou, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. ACM SIGPLAN Notices, vol. 30(8), pp. 207-216, 1995. |
....and compilations techniques adequate to profit from this kind of hardware are major research areas. In recent years the focus has shifted from pure dataflow languages such as Id [21] to numerically oriented Sisal [18] and finally to the compilation of more conventional languages such as Cilk [5] (a multithreaded C) and ML on von Neumann architectures, a shift driven by Nikhil and Arvind s seminal work on P RISC [22] Languages that allow an efficient compilation from highlevel constructs into low level, fine grained, threads are quite suitable for multithreaded computing. In this ....
....extension the join pattern. Patterns combine names, input processes and replication into a single construct. A join pattern defines a synchronization pattern between input processes waiting on a collection of names. On a more conventional side, Cilk is the project most akin to ours. Cilk [5] is an efficient multithreaded runtime system developed at MIT. Cilk computations may be viewed as directed acyclic graphs that evolve in time. Cilk programs are composed of a sequence of procedures each of which is broken into a sequence of one or more threads. Threads are non blocking, which ....
R. D. Blumofe, C. F. Joerg, and et.al. Cilk: an efficient multithreaded runtime system. ACM SIGPLAN Notices, 30(8):207--216, 1995.
....and its overhead. Both are minor issues for coarse grain jobs but they are critical for fine grain services. This study has focused on load distribution policies initiated from service clients. Server initiated load balancing and work stealing among servers have been studied in previous research [19, 31, 83]. In particular, Eager et al. 53 show that client initiated policies perform better than server initiated policies under light to moderate system loads. The performance comparison under high system loads depends on the job transfer cost, with high transfer cost favoring client initiated policies ....
....light to moderate system loads. The performance comparison under high system loads depends on the job transfer cost, with high transfer cost favoring client initiated policies [31] In a different context, work stealing has been successfully employed in multi threaded runtime systems like Cilk [19] due to the low job transfer cost in shared memory multi processors. Data locality. This study on cluster load balancing does not consider the impact of memory locality on the service processing time. The service data for cluster based data intensive applications is typically partitioned such ....
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. In Proc. of ACM Symposium on Principles & Practice of Parallel Programming, pages 207--216, Santa Barbara, CA, July 1995.
.... Linda was originally used in the Piranha [55] system, and more recently implemented in Java by WWWinda [64] Jada [125] and the older version of Javelin, SuperWeb [6] Sun itself is currently using a Linda like tuple space as a basis for their Jini and JavaSpaces technologies [145] In Cilk [17], a task running on a node, A, can spawn a child task, which the node then executes. If another node, B, runs out of work while nodeA is still running the child task, it can steal the parent task from nodeA and continue to execute it. This workstealing algorithm has been shown to be provably ....
....can then route messages to the appropriate work engines and work data on other machines. Of course, PVM is a bad example since it is not adaptive. However, we use it here as an extreme case i.e. if you can implement PVM, then implementing other programming models (e.g. Linda [26] Cilk [17]) is at least as easy, since PVM (and message passing in general) can implement these. By extending the eager scheduling work manager and work pool objects as shown in Fig. 36, we have written implementations of the majority voting and spot checking mechanisms described in more detail in Chap. ....
R.D. Blumofe, C.F. Joerg, B.C. Kuszmaul, C.E. Leiserson, K.H. Randall, Y. Zhou. Cilk: An Efficient Multithreaded Runtime System, in Proc. of the 5th ACM SIGPLAN Symposium on Principles of Parallel Programming (PPOPP '95), July 1995. URL: http://supertech.lcs.mit.edu/cilk/
....concurrency and scheduling autonomy, are better suited to cohort scheduling. Actors are, in turn, an instance of dataflow, a more general computing model [23, 24] Stages also can be viewed as an instance of dataflow computation. Cilk is language based on a provably efficient scheduling policy [11]. The language is thread, not object, based, but it shares some characteristics with stages. In both, once started, a computation is not preempted. While running, a computation can spawn off other tasks, which return their results by invoking a continuation. However, Cilk s work stealing ....
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou, "Cilk: An Efficient Multithreaded Runtime System," Journal of Parallel and Distributed Computing, vol. 37, num. 1, pp. 55-69, 1996.
....our experiments are reproduced in this section. Section 5 describes the compiler optimizations that are essential to utilize the new architecture. 2. Our Architecture The execution model of the proposed architecture relies on a non blocking datadriven threads, akin to TAM [Culler 93] and Cilk [Blumofe 95] threads. At a programming level, a program is viewed as a set of activation frames and each frame consists of several non blocking threads. A non blocking thread typically corresponds to a basic block and an activation frame is typically a loop iteration, a function or a unit of distribution. ....
Blumofe, R. D. et. al., "Cilk: An efficient multithreaded runtime system", Proc of the 5th ACM Symposium on Principles and Practice of Parallel Programming (PPoP), July 1995.
....our experiments are reproduced in this section. Section 5 describes the compiler optimizations that are essential to utilize the new architecture. 2. Our Architecture The execution model of the proposed architecture relies on a non blocking data driven threads, akin to TAM [Culler 93] and Cilk [Blumofe 95] threads. At a programming level, a program is viewed as a set of activation frames and each frame consists of several non blocking threads. A nonblocking thread typically corresponds to a basic block and an activation frame is typically a loop iteration or a function. The threads within an ....
Blumofe, R. D. et. al., "Cilk: An efficient multithreaded runtime system", Proc of the 5th ACM Symposium on Principles and Practice of Parallel Programming (PPoP), July 1995.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207--216, Santa Barbara, California, July 1995.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '95), pages 207--216, Santa Barbara, California, July 1995. (http://theory.lcs.mit.edu/pub/cilk/PPoPP95 .ps.Z).
....clients. For parallel applications, operating systems provide system calls for the creation and synchronization of multiple threads, and they provide high level multithreaded programming support with parallelizing compilers and threads libraries. In addition, programming languages, such as Cilk [7, 21] and Java [3] support multithreading with linguistic abstractions. A major factor in the performance of such multithreaded parallel applications is the operation of the thread scheduler. Prior work on thread scheduling [4, 5, 8, 13, 14] has dealt exclusively with non multiprogrammed environments ....
.... is efficient with respect to both space and communication [8] Moreover, when coupled with dag consistent distributed shared memory, work stealing is also efficient with respect to page faults [6] For these reasons, work stealing is practical and variants have been implemented in many systems [7, 19, 20, 24, 34, 38]. For general multithreaded computations, other scheduling algorithms have also been shown to be simultaneously efficient with respect to time and space [4, 5, 13, 14] Of particular interest here is the idea of deriving parallel depth first schedules from serial schedules [4, 5] which produces ....
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. Journal of Parallel and Distributed Computing, 37(1):55--69, August 1996.
....joint work with members of the Cilk team: Matteo Frigo, Michael Halbherr, Chris Joerg, Bradley Kuszmaul, Charles Leiserson, Rob Miller, Keith Randall, and Yuli Zhou all currently or formerly of MIT s Laboratory for Computer Science. Some of the material in this chapter was previously published in [12]. 63 5.1 The Cilk language and runtime system The Cilk language [10] extends C with primitives to express parallelism, and the Cilk runtime system maps the expressed parallelism into parallel execution. A Cilk program is preprocessed to C using the cilk2c translator [76] and then compiled ....
....instruction that is the first instruction of its thread can have an incoming Some of the research reported in this section is joint work with Charles Leiserson and Keith Randall both of MIT s Laboratory for Computer Science. The material in this section generalizes results previously publishedin [12]. t 1 t 2 v 9 v 8 v 16 v 15 21 v 10 v 11 Figure 5.17: A Cilk computation. This computation contains 24 instructions v 1 ; v 2 ; v 24 represented by the circles, and 10 threads t 1 ; t 2 ; t 10 represented by the dark shaded rectangles, and 6 procedures G 1 ; G ....
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 207--216, Santa Barbara, California, July 1995.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, Y. C. E. Zhou, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. ACM SIGPLAN Notices, vol. 30(8), pp. 207-216, 1995.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kusmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An Efficient Multithreaded Runtime System. Journal of Parallel and Distributed Computing, 37(1):55--69, August 1996. 229
No context found.
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., and Zhou, Y. 1995. Cilk: an efficient multithreaded runtime system. ACM SIGPLAN Notices 30, 8 (Aug.), 207--216.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System, in Proceedings of the 5 th ACM SIGPLAN Symposium on Principles of Parallel Programming, 1995.
No context found.
R.D. Blumofe, C.F. Joerg, et al., "Cilk: An Efficient Multithreaded Runtime System," Proc. Fifth ACM Conf. Principles and Practices of Parallel Programming (PPoPP), 1995.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: an efficient multithreaded runtime system. ACM SIGPLAN Notices, 30(8):207--216, August 1995.
No context found.
R. D. Blumofe, C. F. Joerg, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. In 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207--216, 1995.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), pages 207--216, Santa Barbara, California, July 19-21 1995.
No context found.
R.D. Blumofe et al., "Cilk: An Efficient Multithreaded Runtime System," ," Journ. Paral. Distr. Comput., Vol. 37, 1996, pp. 55-69.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Andrew Shaw, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, July 1995.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207--216, Santa Barbara, CA, July 1995. Also see http://theory.lcs.mit.edu/cilk.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficientmultithreaded runtime system. The Journal of Parallel and Distributed Computing, 37(1):55-- 69, August 1996.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207--216, Santa Barbara, CA, July 1995. Also see http://theory.lcs.mit.edu/cilk.
No context found.
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. In Proc. 6th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 207--216, July 1995.
No context found.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. In Proceedings of the 5th Symposium on Principles and Practice of Parallel Programming, July 1995.
First 50 documents Next 50
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