| B. S. Elenbogen. Parallel and Distributed Algorithms: Laboratory Assignments in Joyce/Linda. In on Computer Science Education, volume 28, pages 14-- 18, Philadelphia, Pennslvania, March 1996. ACM. |
....had felt what it is like to teach a computer. Most of the results confirm existing studies dealing with learning programming and SV in general: the novices would have needed syntax related support (Merrill et al. 1995) the SV accelerated the learning (Boroni et al. 1996) or was otherwise useful (Elenbogen 1996; Palakal, Myers Boyd 1998) Considering Jeliot, the user interface and especially the error messages need to be developed. The lack of text input and output features almost completely prevented the use of Jeliot in Group 1. It is evident that these features should be implemented. The results ....
Elenbogen, B. S. (1996) Parallel and Distributed Algorithms Laboratory Assignments in Joyce/Linda.
....issues concerning the operating system and the parallel architecture. Integrating Theory and Practice Practical support for teaching Parallel and Distributed Processing can be entirely based on the high level programming language level. Languages such as Occam [15] or Lindabased languages [4, 8] can be used with the advantage of clearly illustrating the adequacy (or lack of it) of a specific programming paradigm to solve distinct problems. Alternatively, a more generic (and flexible) approach consists in using a language such as SR [1] offering the possibility of exploiting several ....
B. S. Elenbogen. Parallel and Distributed Algorithms: Laboratory Assignments in Joyce/Linda. In on Computer Science Education, volume 28, pages 14-- 18, Philadelphia, Pennslvania, March 1996. ACM.
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