The challenges of efficient code-generation for massively parallel architectures
McGuiness, Jason M.; Egan, Colin; Christianson, B.; Gao, Guang
Citation: McGuiness , J M , Egan , C , Christianson , B & Gao , G 2006 , ' The challenges of efficient code-generation for massively parallel architectures ' Lecture Notes in Computer Science , vol 4186 , pp. 416-422 . DOI: 10.1007/11859802_38
Overcoming the memory wall  may be achieved by increasing the bandwidth and reducing the latency of the processor to memory connection, for example by implementing Cellular architectures, such as the IBM Cyclops. Such massively parallel architectures have sophisticated memory models. In this paper we used DIMES (the Delaware Iterative Multiprocessor Emulation System), developed by CAPSL at the University of Delaware, as a hardware evaluation tool for cellular architectures. The authors contend that there is an open question regarding the potential, ideal approach to parallelism from the programmer's perspective. For example, at language-level such as UPC or HPF, or using trace-scheduling, or at a library-level, for example OpenMP or POSIX-threads. To investigate this, we have chosen to use a threaded Mandelbrot-set generator with a work-stealing algorithm to evaluate the DIMES cthread programming model for writing a simple multi-threaded program.
Original article can be found at: http://www.springerlink.com/
This item appears in the following Collection(s)
Your requested file is now available for download. You may start your download by selecting the following link: test