Relevant bibliographies by topics / Parallel programs / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Parallel programs.

Dissertations / Theses on the topic 'Parallel programs'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Parallel programs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Smith, Edmund. "Parallel solution of linear programs." Thesis, University of Edinburgh, 2013. http://hdl.handle.net/1842/8833.

Full text
Abstract:
The factors limiting the performance of computer software periodically undergo sudden shifts, resulting from technological progress, and these shifts can have profound implications for the design of high performance codes. At the present time, the speed with which hardware can execute a single stream of instructions has reached a plateau. It is now the number of instruction streams that may be executed concurrently which underpins estimates of compute power, and with this change, a critical limitation on the performance of software has come to be the degree to which it can be parallelised. The
APA, Harvard, Vancouver, ISO, and other styles
2

D'Paola, Oscar Naim. "Performance visualization of parallel programs." Thesis, University of Southampton, 1995. https://eprints.soton.ac.uk/365532/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Busvine, David John. "Detecting parallel structures in functional programs." Thesis, Heriot-Watt University, 1993. http://hdl.handle.net/10399/1415.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Justo, George Roger Ribeiro. "Configuration-oriented development of parallel programs." Thesis, University of Kent, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.333965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mukherjee, Joy. "A Runtime Framework for Parallel Programs." Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/28756.

Full text
Abstract:
This dissertation proposes the Weaves runtime framework for the execution of large scale parallel programs over lightweight intra-process threads. The goal of the Weaves framework is to help process-based legacy parallel programs exploit the scalability of threads without any modifications. The framework separates global variables used by identical, but independent, threads of legacy parallel programs without resorting to thread-based re-programming. At the same time, it also facilitates low-overhead collaboration among threads of a legacy parallel program through multi-granular selective shar
APA, Harvard, Vancouver, ISO, and other styles
6

Hinz, Peter. "Visualizing the performance of parallel programs." Master's thesis, University of Cape Town, 1996. http://hdl.handle.net/11427/16141.

Full text
Abstract:
Bibliography: pages 110-115.<br>The performance analysis of parallel programs is a complex task, particularly if the program has to be efficient over a wide range of parallel machines. We have designed a performance analysis system called Chiron that uses scientific visualization techniques to guide and help the user in performance analysis activities. The aim of Chiron is to give the user full control over what section of the data he/she wants to investigate in detail. Chiron uses interactive three-dimensional graphics techniques to display large amounts of data in a compact and easy to under
APA, Harvard, Vancouver, ISO, and other styles
7

Hayashi, Yasushi. "Shape-based cost analysis of skeletal parallel programs." Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/14029.

Full text
Abstract:
This work presents an automatic cost-analysis system for an implicitly parallel skeletal programming language. Although deducing interesting dynamic characteristics of parallel programs (and in particular, run time) is well known to be an intractable problem in the general case, it can be alleviated by placing restrictions upon the programs which can be expressed. By combining two research threads, the “skeletal” and “shapely” paradigms which take this route, we produce a completely automated, computation and communication sensitive cost analysis system. This builds on earlier work in the area
APA, Harvard, Vancouver, ISO, and other styles
8

Grove, Duncan A. "Performance modelling of message-passing parallel programs." Title page, contents and abstract only, 2003. http://web4.library.adelaide.edu.au/theses/09PH/09phg8832.pdf.

Full text
Abstract:
This dissertation describes a new performance modelling system, called the Performance Evaluating Virtual Parallel Machine (PEVPM). It uses a novel bottom-up approach, where submodels of individual computation and communication events are dynamically constructed from data-dependencies, current contention levels and the performance distributions of low-level operations, which define performance variability in the face of contention.
APA, Harvard, Vancouver, ISO, and other styles
9

Simpson, David John. "Space-efficient execution of parallel functional programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0028/NQ51922.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Novillo, Diego. "Analysis and optimization of explicitly parallel programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0012/NQ60007.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Zhu, Yingchun. "Optimizing parallel programs with dynamic data structures." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0035/NQ64708.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Wei, Jiesheng. "Hardware error detection in multicore parallel programs." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/42961.

Full text
Abstract:
The scaling of Silicon devices has exacerbated the unreliability of modern computer systems, and power constraints have necessitated the involvement of software in hardware error detection. Simultaneously, the multi-core revolution has impelled software to become parallel. Therefore, there is a compelling need to protect parallel programs from hardware errors. Parallel programs’ tasks have significant similarity in control data due to the use of high-level programming models. In this thesis, we propose BlockWatch to leverage the similarity in parallel program’s control data for detecting hardw
APA, Harvard, Vancouver, ISO, and other styles
13

Zhu, Yingchun 1968. "Optimizing parallel programs with dynamic data structures." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36745.

Full text
Abstract:
Distributed memory parallel architectures support a memory model where some memory accesses are local, and thus inexpensive, while other memory accesses are remote, and potentially quite expensive. In order to achieve efficiency on such architectures, we need to reduce remote accesses. This is particularly challenging for applications that use dynamic data structures.<br>In this thesis, I present two compiler techniques to reduce the overhead of remote memory accesses for dynamic data structure based applications: locality techniques and communication optimizations. Locality techniques include
APA, Harvard, Vancouver, ISO, and other styles
14

Grant-Duff, Zulena Noemi. "Systematic construction and mapping of parallel programs." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Eaton, Anthony John. "Graphical debugging and validation of parallel programs." Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357386.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Wilson, Gregory V. "Structuring and supporting programs on parallel computers." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/12151.

Full text
Abstract:
Distributed-memory multicomputers will not find acceptance outwith the specialised field of high-performance numerical applications until programs written for them using systems similar to those found on conventional uniprocessors can be run with an efficiency comparable to that achieved on those uniprocessors. This work argues that the key to constructing upwardly-compatible programming systems for multicomputers based on message passing which are both efficient and usable, and which allow effective monitoring, is to require those systems to be structured, in the same way that modern programm
APA, Harvard, Vancouver, ISO, and other styles
17

Chong, Nathan. "Scalable verification techniques for data-parallel programs." Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/24437.

Full text
Abstract:
This thesis is about scalable formal verification techniques for software. A verification technique is scalable if it is able to scale to reasoning about real (rather than synthetic or toy) programs. Scalable verification techniques are essential for practical program verifiers. In this work, we consider three key characteristics of scalability: precision, performance and automation. We explore trade-offs between these factors by developing verification techniques in the context of data-parallel programs, as exemplified by graphics processing unit (GPU) programs (called kernels). This thesis m
APA, Harvard, Vancouver, ISO, and other styles
18

Gadkari, Sanjay Sadanand. "Layered encapsulations for distributed and parallel programs /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487779914826072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Bratvold, Tore Andreas. "Skeleton-based parallelisation of functional programs." Thesis, Heriot-Watt University, 1994. http://hdl.handle.net/10399/1355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Cordova, Gabriel. "A distributed reconstruction of EKG signals." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Luo, Zegang. "Real time cloth modeling using parallel computing /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?MECH%202005%20LUO.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Sharma, Atul. "Scheduling and granularity decisions in parallel functional programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ38408.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Nwana, Vincent Lebga. "Parallel algorithms for solving mixed integer linear programs." Thesis, Brunel University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368540.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

George, Robert Tyler. "Static scheduling of conditional branches in parallel programs." Thesis, Monterey, California. Naval Postgraduate School, 1996. http://hdl.handle.net/10945/9007.

Full text
Abstract:
Approved for public release; distribution is unlimited<br>The problem of scheduling parallel program tasks on multiprocessor systems is known to be NP-complete in its general form. When non-determinism is added to the scheduling problem through loops and conditional branching, an optimal solution is even harder to obtain. The intractability of obtaining an optimal solution for the general scheduling problem has led to the introduction of a large number of scheduling heuristics, These heuristics consider many real world factors, such as communication overhead, target machine topology, and the t
APA, Harvard, Vancouver, ISO, and other styles
25

Grewe, Dominik. "Mapping parallel programs to heterogeneous multi-core systems." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/8852.

Full text
Abstract:
Heterogeneous computer systems are ubiquitous in all areas of computing, from mobile to high-performance computing. They promise to deliver increased performance at lower energy cost than purely homogeneous, CPU-based systems. In recent years GPU-based heterogeneous systems have become increasingly popular. They combine a programmable GPU with a multi-core CPU. GPUs have become flexible enough to not only handle graphics workloads but also various kinds of general-purpose algorithms. They are thus used as a coprocessor or accelerator alongside the CPU. Developing applications for GPU-based het
APA, Harvard, Vancouver, ISO, and other styles
26

Lourenço, João. "A debugging engine for parallel and distributed programs." Doctoral thesis, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2003. http://hdl.handle.net/10362/2314.

Full text
Abstract:
Dissertação apresentada para a obtenção do Grau de Doutor em Informática pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia.<br>In the last decade a considerable amount of research work has focused on distributed debugging, one of the crucial fields in the parallel software development cycle. The productivity of the software development process strongly depends on the adequate definition of what debugging tools should be provided, and what debugging methodologies and functionalities should these tools support. The work described in this dissertation was initiated in 1
APA, Harvard, Vancouver, ISO, and other styles
27

Sanz-Marco, Vicent. "Fault tolerance for stream programs on parallel platforms." Thesis, University of Hertfordshire, 2015. http://hdl.handle.net/2299/17110.

Full text
Abstract:
A distributed system is defined as a collection of autonomous computers connected by a network, and with the appropriate distributed software for the system to be seen by users as a single entity capable of providing computing facilities. Distributed systems with centralised control have a distinguished control node, called leader node. The main role of a leader node is to distribute and manage shared resources in a resource-efficient manner. A distributed system with centralised control can use stream processing networks for communication. In a stream processing system, applications typically
APA, Harvard, Vancouver, ISO, and other styles
28

McPherson, Andrew John. "Ensuring performance and correctness for legacy parallel programs." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/14179.

Full text
Abstract:
Modern computers are based on manycore architectures, with multiple processors on a single silicon chip. In this environment programmers are required to make use of parallelism to fully exploit the available cores. This can either be within a single chip, normally using shared-memory programming or at a larger scale on a cluster of chips, normally using message-passing. Legacy programs written using either paradigm face issues when run on modern manycore architectures. In message-passing the problem is performance related, with clusters based on manycores introducing necessarily tiered topolog
APA, Harvard, Vancouver, ISO, and other styles
29

Nakade, Radha Vi. "Verification of Task Parallel Programs Using Predictive Analysis." BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/6176.

Full text
Abstract:
Task parallel programming languages provide a way for creating asynchronous tasks that can run concurrently. The advantage of using task parallelism is that the programmer can write code that is independent of the underlying hardware. The runtime determines the number of processor cores that are available and the most efficient way to execute the tasks. When two or more concurrently executing tasks access a shared memory location and if at least one of the accesses is for writing, data race is observed in the program. Data races can introduce non-determinism in the program output making it imp
APA, Harvard, Vancouver, ISO, and other styles
30

Aronsson, Peter. "Automatic Parallelization of Equation-Based Simulation Programs." Doctoral thesis, Linköping : Department of Computer and Information Science, Linköping University, 2006. http://www.bibl.liu.se/liupubl/disp/disp2006/tek1022s.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Verygha, A. "Organization Features of Parallel Processes in Programs for Microcontrollers with a Small Amount of Program Memory." Thesis, NURE, MC&FPGA, 2019. https://mcfpga.nure.ua/conf/2019-mcfpga/10-35598-mcfpga-2019-005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Korndorfer, Jonas Henrique Muller. "High performance trace replay event simulation of parallel programs behavior." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/149310.

Full text
Abstract:
Sistemas modernos de alto desempenho compreendem milhares a milhões de unidades de processamento. O desenvolvimento de uma aplicação paralela escalável para tais sistemas depende de um mapeamento preciso da utilização recursos disponíveis. A identificação de recursos não utilizados e os gargalos de processamento requere uma boa análise desempenho. A observação de rastros de execução é uma das técnicas mais úteis para esse fim. Infelizmente, o rastreamento muitas vezes produz grandes arquivos de rastro, atingindo facilmente gigabytes de dados brutos. Portanto ferramentas para análise de desempe
APA, Harvard, Vancouver, ISO, and other styles
33

Castro, David. "Structured arrows : a type-based framework for structured parallelism." Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/16093.

Full text
Abstract:
This thesis deals with the important problem of parallelising sequential code. Despite the importance of parallelism in modern computing, writing parallel software still relies on many low-level and often error-prone approaches. These low-level approaches can lead to serious execution problems such as deadlocks and race conditions. Due to the non-deterministic behaviour of most parallel programs, testing parallel software can be both tedious and time-consuming. A way of providing guarantees of correctness for parallel programs would therefore provide significant benefit. Moreover, even if we i
APA, Harvard, Vancouver, ISO, and other styles
34

Kondo, Boubacar. "An investigation of parallel algorithms developed for graph problems and their implementation on parallel computers." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/770951.

Full text
Abstract:
With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computatio
APA, Harvard, Vancouver, ISO, and other styles
35

Lin, Jason. "WebSearch: A configurable parallel multi-search web browser." CSUSB ScholarWorks, 1999. https://scholarworks.lib.csusb.edu/etd-project/1948.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

DUARTE, Rafael Machado. "Parallelizing Java programs using transformation laws." Universidade Federal de Pernambuco, 2008. https://repositorio.ufpe.br/handle/123456789/2357.

Full text
Abstract:
Made available in DSpace on 2014-06-12T15:57:17Z (GMT). No. of bitstreams: 2 arquivo3161_1.pdf: 1109714 bytes, checksum: 63bb826b538cafab9528cb9cb8274bdc (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2008<br>Conselho Nacional de Desenvolvimento Científico e Tecnológico<br>Com a adoção pelo mercado dos processadores de nucleos multiplos, o uso de threads em Java se torna cada vez mais proveitoso. O desenvolvimento de sistemas paralelos e, entretanto, uma tarefa que poucos desenvolvedores estão capacitados a enfrentar. Dado esse cont
APA, Harvard, Vancouver, ISO, and other styles
37

Aksenov, Vitalii. "Synchronization costs in parallel programs and concurrent data structures." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC025/document.

Full text
Abstract:
Pour utiliser la puissance de calcul des ordinateurs modernes, nous devons écrire des programmes concurrents. L’écriture de programme concurrent efficace est notoirement difficile, principalement en raison de la nécessité de gérer les coûts de synchronisation. Dans cette thèse, nous nous concentrons sur les coûts de synchronisation dans les programmes parallèles et les structures de données concurrentes.D’abord, nous présentons une nouvelle technique de contrôle de la granularité pour les programmes parallèles conçus pour un environnement de multi-threading dynamique. Ensuite, dans le contexte
APA, Harvard, Vancouver, ISO, and other styles
38

Farooq, Mohammad Habibur Rahman &amp Qaisar. "Performance Prediction of Parallel Programs in a Linux Environment." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1143.

Full text
Abstract:
Context. Today’s parallel systems are widely used in different computational tasks. Developing parallel programs to make maximum use of the computing power of parallel systems is tricky and efficient tuning of parallel programs is often very hard. Objectives. In this study we present a performance prediction and visualization tool named VPPB for a Linux environment, which had already been introduced by Broberg et.al, [1] for a Solaris2.x environment. VPPB shows the predicted behavior of a multithreaded program using any number of processors and the behavior is shown on two different graphs. Th
APA, Harvard, Vancouver, ISO, and other styles
39

Bischof, Holger [Verfasser]. "Systematic Development of Parallel Programs Using Skeletons / Holger Bischof." Aachen : Shaker, 2005. http://d-nb.info/1186580348/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Railing, Brian Paul. "Collecting and representing parallel programs with high performance instrumentation." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54431.

Full text
Abstract:
Computer architecture has looming challenges with finding program parallelism, process technology limits, and limited power budget. To navigate these challenges, a deeper understanding of parallel programs is required. I will discuss the task graph representation and how it enables programmers and compiler optimizations to understand and exploit dynamic aspects of the program. I will present Contech, which is a high performance framework for generating dynamic task graphs from arbitrary parallel programs. The Contech framework supports a variety of languages and parallelization libraries, and
APA, Harvard, Vancouver, ISO, and other styles
41

Polzin, Dieter Wilhelm. "Visualizing the memory performance of parallel programs with Chiron." Master's thesis, University of Cape Town, 1996. http://hdl.handle.net/11427/9283.

Full text
Abstract:
Bibliography: leaves 78-81.<br>This thesis describes Chiron, visualization system which helps programmers detect memory system bottlenecks in their shared-memory parallel applications. Chiron is different from most other performance debugging tools in that it uses three-dimensional graphics techniques to display vast amounts of memory-performance data. Both code-and data-oriented information can be presented in several views. These views have been designed to help the user detect problems which cause coherence interference or replacement interference. Chiron’s interactive user-interface enable
APA, Harvard, Vancouver, ISO, and other styles
42

Zhang, Yuan. "Static analyses and optimizations for parallel programs with synchronization." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 169 p, 2008. http://proquest.umi.com/pqdweb?did=1601517931&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Karl, Holger. "Responsive Execution of Parallel Programs in Distributed Computing Environments." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 1999. http://dx.doi.org/10.18452/14455.

Full text
Abstract:
Vernetzte Standardarbeitsplatzrechner (sog. Cluster) sind eine attraktive Umgebung zur Ausf"uhrung paralleler Programme; f"ur einige Anwendungsgebiete bestehen jedoch noch immer ungel"oste Probleme. Ein solches Problem ist die Verl"asslichkeit und Rechtzeitigkeit der Programmausf"uhrung: In vielen Anwendungen ist es wichtig, sich auf die rechtzeitige Fertigstellung eines Programms verlassen zu k"onnen. Mechanismen zur Kombination dieser Eigenschaften f"ur parallele Programme in verteilten Rechenumgebungen sind das Hauptanliegen dieser Arbeit. Zur Behandlung dieses Anliegens ist eine gemein
APA, Harvard, Vancouver, ISO, and other styles
44

Tang, Dezheng. "Mapping Programs to Parallel Architectures in the Real World." PDXScholar, 1992. https://pdxscholar.library.pdx.edu/open_access_etds/4534.

Full text
Abstract:
Mapping an application program to a parallel architecture can be described as a multidimensional optimization problem. To simplify the problem, we divide the overall mapping process into three sequential substeps: partitioning, allocating, and scheduling, with each step using a few details of the program and architecture description. Due to the difficulty in accurately describing the program and architecture and the fact that each substep uses incomplete information, inaccuracy is pervasive in the real-world mapping process. We hypothesize that the inaccuracy and the use of suboptimal, heurist
APA, Harvard, Vancouver, ISO, and other styles
45

Florez-Larrahondo, German. "A trusted environment for MPI programs." Master's thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-10172002-103135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Kim, Minjang. "Dynamic program analysis algorithms to assist parallelization." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45758.

Full text
Abstract:
All market-leading processor vendors have started to pursue multicore processors as an alternative to high-frequency single-core processors for better energy and power efficiency. This transition to multicore processors no longer provides the free performance gain enabled by increased clock frequency for programmers. Parallelization of existing serial programs has become the most powerful approach to improving application performance. Not surprisingly, parallel programming is still extremely difficult for many programmers mainly because thinking in parallel is simply beyond the human perceptio
APA, Harvard, Vancouver, ISO, and other styles
47

Collins, Alexander James. "Cooperative auto-tuning of parallel skeletons." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/15791.

Full text
Abstract:
Improving program performance through the use of multiple homogeneous processing elements, or cores, is common-place. However, these architectures increase the complexity required at the software level. Existing work is focused on optimising programs that run in isolation on these systems, but ignores the fact that, in reality, these systems run multiple parallel programs concurrently with programs competing for system resources. In order to improve performance in this shared environment, cooperative tuning of multiple, concurrently running parallel programs is required. Moreover, the set of p
APA, Harvard, Vancouver, ISO, and other styles
48

Junaidu, Sahalu B. "A parallel functional language compiler for message-passing multicomputers." Thesis, University of St Andrews, 1998. http://hdl.handle.net/10023/13450.

Full text
Abstract:
The research presented in this thesis is about the design and implementation of Naira, a parallel, parallelising compiler for a rich, purely functional programming language. The source language of the compiler is a subset of Haskell 1.2. The front end of Naira is written entirely in the Haskell subset being compiled. Naira has been successfully parallelised and it is the largest successfully parallelised Haskell program having achieved good absolute speedups on a network of SUN workstations. Having the same basic structure as other production compilers of functional languages, Naira's parallel
APA, Harvard, Vancouver, ISO, and other styles
49

Jones, Philip E. C. "Common subexpression detection in dataflow programs /." Title page, contents and summary only, 1989. http://web4.library.adelaide.edu.au/theses/09SM/09smj78.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Leth, Lone. "Functional programs as reconfigurable networks of communicating processes." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Parallel programs' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography