J.H. Chow and W.L. Harrison III. Microtasking Recursive, Parallel Programs. In Proceedings of the 1990 International Conference on Parallel Processing (Vol II Software), pages 282--283, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....loops, consider what happens below. We would be inclined to think that is a valid transformation. There is a problem, though, with the observation that the loops could be run in parallel, since there are, under analysis 39 First run. Second run. Sequential version. v; v; v; [1, 2, 4, 4, 5]; 1, 2, 4, 5, 5] 2, 3, 4, 5, 6] Nondeterminism Figure 5.5: Nondeterminism used for languages like C or Fortran, no cross iteration dependencies. Look at what consecutive Parallel ISETL runs of the cdoall code from the above example produces below. We see we did not preserve sequential ....

....what happens below. We would be inclined to think that is a valid transformation. There is a problem, though, with the observation that the loops could be run in parallel, since there are, under analysis 39 First run. Second run. Sequential version. v; v; v; 1, 2, 4, 4, 5] [1, 2, 4, 5, 5]; 2, 3, 4, 5, 6] Nondeterminism Figure 5.5: Nondeterminism used for languages like C or Fortran, no cross iteration dependencies. Look at what consecutive Parallel ISETL runs of the cdoall code from the above example produces below. We see we did not preserve sequential consistency under our ....

[Article contains additional citation context not shown here]

J.H. Chow and W.L. Harrison III. Microtasking Recursive, Parallel Programs. In Proceedings of the 1990 International Conference on Parallel Processing (Vol II Software), pages 282--283, 1990.

....linkage pointer. In IML, when a new level of parallelism is invoked, the parent context is immediately suspended, and child contexts are initiated from a pre allocated and recycled fiber pool. Upon completion of the parallel section, one of the active children contexts resumes the parent context [1]. Compiler Generated Parallel Code Parallel programming, compared to sequential programming, is a difficult and error prone process. Methods to automate or semi automate this process are of great value to programmers. Automatic tools, such as automatic parallelizing compilers, are the ultimate ....

Chow, J-H. and Harrison, L., Microtasking Recursive, Parallel Programs, In Proc. of Int'l Conf. on Parallel Processing Vol. 2: Software, 1990

....4. Process Stack Configuration. In IML, when a new level of parallelism is invoked, the parent context is yielded, and child contexts are started from a pre allocated and recycled fiber pool. Upon completion of the parallel section, one of the active children contexts resumes the parent context [1]. 2.5 Support for OpenMP Overview of the OpenMP standard OpenMP [9] is a recently adopted industry standard for parallel programming. Currently, it consists of FORTRAN and C C compiler directives, environment variables, and runtime library functions for execution environments and lock ....

....routines [5] BLAS3 (matrix matrix operations) routines have their own conventional multiprocessing runtime library. Despite IML s flexibility, BLAS3 routines re implemented with IML did not degrade in performance. 4. 2 Nested Parallelism Chow and Harrison studied support for nested parallel loops [1] and implemented it on top of the microtasking environment on the Alliant FX 8 minisupercomputer. IML employs their Switch Stacks approach using Windows NT fibers. IML switches stacks upon entry to the parallel loop while Switch Stacks switches stacks when the initiating processor finishes its ....

J-H. Chow and L. Harrison. Microtasking recursive, parallel programs. In Proceedings of the International Conference on Parallel Processing, 1990.

....by a static linkage pointer. In IML, when a new level of parallelism is invoked, the parent context is yielded, and child contexts are started from a pre allocated and recycled fiber pool. Upon completion of the parallel section, one of the active children contexts resumes the parent context [1]. arg1 body arg0 arg1 arg2 arg0 arg1 arg2 arg0 arg1 arg2 arg0 arg1 arg0 array A var u var varx var w COBEGIN(func1, func2, x, A) DOALL(body, u, A, v) body body func1 func2 Fiber0 Fiber1 Fiber2 Fiber3 Fiber4 Fiber5 suspended active vary var y vary Fig. 4. Process Stack Configuration. 2.5 ....

....[5] BLAS3 (matrix matrix operations) routines have their own conventional multiprocessing runtime library. Despite IML s flexibility, BLAS3 routines re implemented with IML did not degrade in performance. 4. 2 Nested Parallelism Chow and Harrison studied support for nested parallel loops [1] and implemented it on top of the microtasking environment on the Alliant FX 8 minisupercomputer. IML employs their Switch Stacks approach using Windows NT fibers. IML switches stacks upon entry to the parallel loop while Switch Stacks switches stacks when the initiating processor finishes its ....

J-H. Chow and L. Harrison. Microtasking recursive, parallel programs. In Proceedings of the International Conference on Parallel Processing, 1990.

....be implemented with any of the above thread packages. However, its full potential can only be exploited with the kernel support similar to IRIX nanothreads. The initial version of IML is implemented on Windows NT for IA32 using threads and fibers. IML uses fibers as a replacement of Switch Stacks [4][3] Other features of fibers are not essential to IML. A task in IML can be seen as a fine grain user level thread, and the IML scheduler implements user level context switches through task switching. Such approach would continue to be useful until user threads become easily reusable or the ....

....(matrix matrix operations) routines have their own conventional multipro7 cessing runtime library. Despite IML s flexibility, BLAS3 routines re implemented with IML did not degrade in performance (Section 5.2.2) 2.1. 3 Nested Parallelism Chow and Harrison studied support for nested parallel loops [4][3] and implemented it on top of the microtasking environment on the Alliant FX 8 mini supercomputer. IML employs their Switch Stacks approach using Windows NT fibers. IML switches stacks upon entry to the parallel loop while Switch Stacks switches stacks when the initiating processor finishes ....

[Article contains additional citation context not shown here]

J-H. Chow and L. Harrison. Microtasking recursive, parallel programs. In Proceedings of the International Conference on Parallel Processing, 1990.

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