| M. Philippsen and W. F. Tichy. Modula-2 and its compilation. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, Austria, September 1991. |
....based on graph reduction interpreters for functional languages. Their performance tends to be scalable, but in absolute measures still below the speed of sequential work stations. Philippsen et al. introduce two variants of a forall statement, a synchronous version and an asynchronous one [PT91] The asynchronous forall enables multiple threads of control to coexist. This can either be emulated using stacks of MASK bits, or it can be implemented directly in an MSIMD machine which contains multiple program counters. In either case, their proposal is mainly concerned with enabling the ....
M. Philippsen and W. F. Tichy. Modula-2 and its compilation. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, Austria, September 1991.
....the Fortran D compiler in the ParaScope programming environment [14] 7 Related Work The restricted control flow of pure SIMD programming has been addressed by several researchers. Philippsen and Tichy introduce two variants of a FORALL statement, a synchronous version and an asynchronous one [17]. The asynchronous FORALL allows multiple threads of control to coexist. This can either be emulated using stacks of MASK bits, or it can be implemented directly in an MSIMD machine which contains multiple program counters. In either case, their proposal is mainly concerned with allowing the ....
M. Philippsen and W. F. Tichy. Modula-2 and its compilation. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, Austria, September 1991.
....based on graph reduction interpreters for functional languages. Their performance tends to be scalable, but in absolute measures still below the speed of sequential workstations. Philippsen et al. introduce two variants of a FORALL statement, a synchronous version and an asynchronous one [PT91a] The asynchronous FORALL enables multiple threads of control to coexist. This can either be emulated using stacks of MASK bits, or it can be implemented directly in an MSIMD machine which contains multiple program counters. In either case, their proposal is mainly concerned with enabling the ....
M. Philippsen and W. F. Tichy. Modula-2 and its compilation. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, Austria, September 1991.
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