Abstract

OF DISSERTATION EFFICIENCY AND EXPRESSIVITY OF DECLARATIVE PROGRAMMING LANGUAGES High level declarative languages are considered appropriate for parallel programming as they insulate programmers from architectural details and scheduling and synchronization issues, while offering plenty of exploitable parallelism. In the dissertation presented here, we focus on one such language, Id, which consists of three layers. Id has a purely functional language (F) at its core, a layer of I-structures (I), and a layer of M-structures (M) at the top. In an effort to deduce what language layer is required for the best implementation of a given algorithm, we implement two NAS benchmark problems, NAS IS (integer sort) and FT (3D heat equation solver) using F , I and M layers of Id. We show for sorting algorithms that perform exchanges of array elements, use of M-structures can increase efficiency. We demonstrate that the classical sort algorithms outperform the explicit parallel ones in the implicitly...

Citations