A Survey on Parallel Architecture and Parallel Programming Languages and Tools

In this paper, we have presented a brief review on the evolution of parallel computing to multi - core architecture. The survey briefs more than 45 languages, libraries and tools used till date to increase performance through parallel programming. We ha ve given emphasis more on the architecture of parallel system in the survey

Visualizing the MPI Programs: Using Continuous Semantic Zooming

Programs depend on the entities. Their hierarchy varies with the complexity and as their utilization increases the complexity involved in hierarchy also increases. Visualization is a traditional method of representing complex entities to enhance the human understanding. Visualization of parallel programs is not a new concept. But, the approaches followed to obtain this goal of visualizing the Message Passing Interface (MPI) programs are unique in their own ways. There are no tools, which are capable of implementing all aspects of MPI programs in an efficient way. The main reason is the complexity of parallel programs. This thesis involves using Flatland [1], a virtual reality application and its implementation through a concept called Continuous Semantic Zooming (CSZ) [2]. It is hypothesized that this method of visualization can help naïve programmers, that is, people with little or no programming experience to understand the concept of MPI programming and also can serve the purpose of the experts in the fields of MPI programming to look deeper into the issues involving debugging and analyzing the MPI program behavior. The output generated as a trace file from a set of nine MPI programs is taken as an input for the visual representation. We focus on the design, data format, the results and experiences obtained from this project

The dynamic simultaneous multithreaded processor

This dissertation investigates diverse techniques to support multithreading in modern high performance processors. The mechanisms studied expand the architecture of a high performance superscalar processor to control efficiently the interaction between software-controlled and hardware-controlled multithreading. Additionally, dynamic speculative mechanisms are proposed to exploit thread-level-parallelism (TLP) and instruction-level-parallelism (ILP) on a Simultaneous Multithreading (SMT) architecture. First, the hybrid multithreaded execution model is discussed. This model combines software-controlled multithreading with hardware support for efficient context switching and thread scheduling. A thread scheduling technique called set scheduling is introduced and its impact on the overall performance is described. An analytical model of the hybrid multithreaded execution is developed and validated by simulation. Through stochastic simulation, we find that the application of the hybrid multithreaded execution model results in higher processor utilization than traditional software-controlled multithreading. Next, in the main part of this dissertation, a new architecture is proposed: the Dynamic Simultaneous Multithreading (DSMT) processor. In this architecture, multiple threads are identified and created speculatively at runtime without compiler help. Subsequently, a SMT processor core executes those threads. The performance of a DSMT processor was evaluated with a new execution-driven simulator developed specifically for the purpose. Our experimental results based on simulation show that DSMT architecture has very good potential to improve SMT processor's performance when there is only a single task available for execution

The Argonne/GMD macros in FORTRAN for portable parallel programming and their implementation on the intel iPSC/2

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Algoritmos paralelos segmentados para los problemas de mínimos cuadrados recursivos (RLS) y de detección por cancelación ordenada y sucesiva de interferencia (OSIC)

Dentro del marco de los sistemas de comunicaciones de banda ancha podemos encontrar canales modelados como sistemas MIMO (Multiple Input Multiple Output) en el que se utilizan varias antenas en el transmisor (entradas) y varias antenas en el receptor (salidas), o bien sistemas de un solo canal que puede ser modelado como los anteriores (sistemas multi-portadora o multicanal con interferencia entre ellas, sistemas multi-usuario con una o varias antenas por terminal móvil y sistemas de comunicaciones ópticas sobre fibra multimodo). Estos sistemas pretenden alcanzar valores de capacidad de transmisión relativa al ancho de banda muy superiores al de un único canal SISO (Single Input Single Output). Hoy en dÍa, existe, desde un punto de vista de implementación del sistema, una gran actividad investigadora dedicada al desarrollo de algoritmos de codificación, ecualización y detección, muchos de ellos de gran complejidad, que ayuden a aproximarse a las capacidades prometidas. En el aspecto relativo a la detección, las soluciones actuales se pueden clasificar en tres tipos: soluciones subóptimas, ML (Maximum Likelihood) o cuasi-ML e iterativas. En estas ultimas, se hace uso explicito de técnicas de control de errores empleando intercambio de información soft o indecisa entre el detector y el decodificador; en las soluciones ML o cuasi-ML se lleva a cabo una búsqueda en árbol que puede ser optimizada llegando a alcanzar complejidades polinómicas en cierto margen de relación señal-ruido; por ultimo dentro de las soluciones subóptimas destacan las técnicas de forzado de ceros, error cuadrático medio y cancelación sucesiva de interferencias SIC (Succesive Interference Cancellation), esta última con una versión ordenada -OSIC-. Las soluciones subóptimas, aunque no llegan al rendimiento de las ML o cuasi-ML son capaces de proporcionar la solución en tiempo polinómico de manera determinista. En la presente tesis doctoral, hemos implementado un método basado en la literatura para lMartínez Zaldívar, FJ. (2007). Algoritmos paralelos segmentados para los problemas de mínimos cuadrados recursivos (RLS) y de detección por cancelación ordenada y sucesiva de interferencia (OSIC) [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/1873Palanci