Developing a data-parallel application with DaParT

Date

2002-01-01

Author

Paker, Yakup
Şener, Cevat
Kiper, Ayşe

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

76
views

0
downloads

In order to simplify the task of developing parallel programs based on data-parallel paradigm, this article presents a data-parallel programming tool: DaParT. With its usage, sequential solutions of the nonexpert parallel programmers can be run in data-parallel. The tool was implemented on Helios, MPL, PVM and MPI. The tool is portable to the parallel environments with the support for the basic message passing primitives. The usage of the tool is clarified by an example: simulation of the Hopfield net. Lastly, the benchmark results collected are discussed.

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84947565913&origin=inward
https://hdl.handle.net/11511/92792

DOI

https://doi.org/10.1007/3-540-48086-2_31

Conference Name

4th International Conference on Parallel Processing and Applied Mathematics, PPAM 2001

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Developing a data-parallel application with DaParT Sener, C; Paker, Y; Kiper, A (2002-01-01) In order to simplify the task of developing parallel programs based on data-parallel paradigm, this article presents a data-parallel programming tool: DaParT. With its usage, sequential solutions of the nonexpert parallel programmers can be run in data-parallel. The tool was implemented on Helios, MPL, PVM and MPI. The tool is portable to the parallel environments with the support for the basic message passing primitives. The usage of the tool is clarified by an example: simulation of the Hopfield net. Last...
Implementation of an 8-bit microcontroller with system c Kesen, Lokman; Aşkar, Murat; Department of Electrical and Electronics Engineering (2004) In this thesis, an 8-bit microcontroller, 8051 core, is implemented using SystemC programming language. SystemC is a new generation co-design language which is capable of both programming software and describing hardware parts of a complete system. The benefit of this design environment appears while developing a System-on-Chip (SoC), that is a system consisting both custom hardware parts and embedded software parts. SystemC is not a completely new language, but based on C++ with some additional class libra...
An Approach to manage variability in object-oriented applications with feature models Bulut, Ender; Şener, Cevat; Department of Computer Engineering (2014) In this thesis, an approach to manage variability in object-oriented applications by using a feature modeling language and a simple source code generation technique has been designed and developed. This approach provides developing configurable object oriented applications in a practical way. That is, an application developed with our approach takes just a configuration file including user selections in a pre-defined domain as input and then automatically configure and manage itself with respect to these se...
Advanced methods for result and score caching in web search engines Yafay, Erman.; Altıngövde, İsmail Sengör; Department of Computer Engineering (2019) Search engines employ caching techniques in main memory to improve system efficiency and scalability. In this thesis, we focus on improving the cache performance for web search engines where our contributions can be separated into two main parts. Firstly, we investigate the impact of the sample size for frequency statistics for most popular cache eviction strategies in the literature, and show that cache performance improves with larger samples, i.e., by storing the frequencies of all (or, most of) the quer...
An analytical model for source code distributability verification Isazadeh, Ayaz; Karimpour, Jaber; Elgedawy, Islam; Izadkhah, Habib (Zhejiang University Press, 2014-02-01) One way to speed up the execution of sequential programs is to divide them into concurrent segments and execute such segments in a parallel manner over a distributed computing environment. We argue that the execution speedup primarily depends on the concurrency degree between the identified segments as well as communication overhead between the segments. To guarantee the best speedup, we have to obtain the maximum possible concurrency degree between the identified segments, taking communication overhead int...

Citation Formats

Y. Paker, C. Şener, and A. Kiper, “Developing a data-parallel application with DaParT,” Naleczow, Polonya, 2002, vol. 2328, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84947565913&origin=inward.