Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Explicit parallelism


Related Topics

In the News (Sun 3 Jun 12)

  
 [No title]
In explicit parallel languages, the the parallelism, data distribution, and communication are all manifest in the program; the compiler's job is just to implement what is specified.
For example, the parallelism may be explicit in the program, but it may be up to the compiler to determine the distribution of data and communication.
Explicit Parallel Programming True explicit parallel programming goes a step further than dataparallel programming to a language where the distribution of computation and data are the responsibility of the programmer.
www.cs.berkeley.edu /~aiken/cs264/lectures/compiling-for-parallelism   (4205 words)

  
 [No title]
Since parallel applications have been widely used in clusters and they are built using parallel programming environments, models and paradigms, this paper mainly focuses on both of these aspects in two separate parts including clustering and parallel programming paradigms.
Implicit Parallelism is characterized by the spectrum of paradigms and approaches in which the inherent parallelism is hidden and is not exposed by the programmer to the compiler.
Explicit Parallelism, on the other hand refers to a group of methods and programs in which the parallelism is exposed and directly specified by the programmer through the use of constructs or libraries of a language (typically a parallel one) designed for that purpose.
home.gwu.edu /~alikhosh/ppp.doc   (4947 words)

  
 [No title]   (Site not responding. Last check: 2007-10-30)
PIM-D Parallel Inference Machine: The PIM-D was proposed to be one of the candidates for a parallel inference machine in the Fifth Generation Computer System and was a joint venture of ICOT and OKI Electric Ind. (Japan) [130, 131, 132].
Simulation results on a parallel ray-tracing application showed that using 8 threads a speed-up of 3.22 in case of one load/store unit and of 5.79 in case of two load/store units can be achieved over a conventional RISC processor.
The total parallelism in the instruction window is restricted in favour of a less costly dispatch that does not slow down processor cycle rate.
www.ubka.uni-karlsruhe.de /vvv/1998/informatik/28/28.text   (16888 words)

  
 [No title]
By simulating the parallel execution it is possible to concentrate on the amount and structure of the parallelism exposed by the program without being distracted by `external' details like load of the machine produced by other users or the basic network traffic.
For simulating parallelism the generated code has to be instrumented, which is achieved by a slightly modified code generator in GHC.
This is expressed with the par annotation, which `sparks' a parallel process for computing its first argument and whose result is its second argument (the exact operational semantics of par is discussed in more detail in chapter *Note Parallelism Annotations::.).
www.cee.hw.ac.uk /~hwloidl/fp-www/software/gransim/user.info-1   (5666 words)

  
 Explicit Parallelism:
is characterized by the presence of explicit constructs in the programming language, aimed at describing (to a certain degree of detail) the way in which the parallel computation will take place.
This goes from specialized libraries supplying a uniform set of communication primitives to hide the details of the computing environment (e.g., PVM [101] and Linda [39]) to sophisticated languages like PCN [35].
The main advantage is its considerable flexibility, which allows to code a wide variety of patterns of execution, giving a considerable freedom in the choice of what should be run in parallel and how.
www.cs.nmsu.edu /~epontell/adventure/node5.html   (257 words)

  
 EPODE
The advantage of parallel methods is their independence of the degree of parallelism of the size of the system of ODE to be solved.
A class of parallel methods is dealt with, where a certain computational overhead is introduced to recast an essentially serial algorithm into a form in which it consists of several extensive (compound) tasks, which can be performed in parallel.
Since parallel computation is becoming widely available it is natural to ask how to construct such methods which are suitable for implementation in a parallel environment.
web.info.uvt.ro /~petcu/epode/e4422.htm   (2662 words)

  
 Overview of the Itanium-based architecture - HP Dev Resource Central
Performance is limited both by the compiler's ability to expose parallelism to the processor and by the processor's ability to locate instructions that can be executed in parallel from the sequential stream of instructions produced the compiler.
In addition, the IPF instruction format itself enables explicit parallelism, breaking the traditional sequential execution paradigm wherein every instruction is assumed to depend on the previous instruction.
Through explicit parallelism, the IPF implementation of EPIC technology enables the compiler and hardware to work together efficiently to expose new levels of parallelism and performance.
www.openview.hp.com /drc/STK/docs/refs/ia64bkgnd.jsp   (2760 words)

  
 Eden: Parallel Functional Programming
It appears to be a contradiction between the efficient exploitation of parallelism and the simplicity of the corresponding programs: the more control the language has on process management, communication and synchronization aspects, the more complex and longer, and the less amenable for reasoning, are the resulting programs.
Parallel programs have the same semantics as their sequential counterparts, so there is no explicit message passing and non-determinism.
While SPMD parallelism is an important emerging paradigm, it has hitherto been unclear how this can be incorporated in the evaluation strategy model, a new model of parallelism which provides a clean separation of behaviour and control for a wide variety of parallel paradigms.
www.mathematik.uni-marburg.de /~eden?content=parfctworkshop   (2546 words)

  
 Motivations and Design Approach for the IA-64 64-Bit Instruction Set Architecture
The other thing that's very important, particularly in the explicit parallelism activity, is what distinguishes us from the earlier VLIW machines, and that is we have built in flexibility in specifying the parallelism so we can offer scalability ahead, and compatibility ahead as we go to wider and wider machines.
We're able to specify from a degree of parallelism 1 up to really an arbitrarily large amount of parallelism, and depending on the width of the machine, then, it can break off very large chunks into whatever its shovel size is and shovel that into the machine.
Again, explicitly parallel, this idea of making the parallelism explicit in the machine code, both makes the compiler's job easier in terms of describing this parallelism directly to the machine, and certainly makes the hardware easier by eliminating a need for a lot of transistors to detect that parallelism.
www.ee.umd.edu /~blj/microarchitecture/crawford+huck.html   (5642 words)

  
 Merced promises you the drive of your life
This type of parallel processing is called "implicit" because the processor decides whether groups of instructions can be run in parallel.
Explicit parallelism - The ability of the compiler to directly inform the processor of the independent nature of operations.
Parallelism - The ability to execute multiple instructions at the same time (in contrast to sequentially, where one instruction is executed after the other).
www.vnunet.com /articles/print/2129476   (1576 words)

  
 Itanium® 2-based solutions from HP – Redirect - glossary   (Site not responding. Last check: 2007-10-30)
This explicit expression of parallelism allows the processor to concentrate on executing parallel code as fast as possible, without further optimizations or interpretations.
The parallelism is there, but it is not as obvious to the processor and more work has to be done by the hardware before it can be utilized.
RISC was a parallel architecture: the Itanium™ processor family has taken the lessons learnt from both RISC and CISC to develop a truly new parallelism.
www.homeandoffice.hp.com /ERC/cache/81308-0-0-0-121.html   (1236 words)

  
 Introduction
Parallel loops are either detected automatically by means of data dependence analysis, or are identified explicitly by the programmer by means of annotations.
Because automatically detecting implicit parallelism in multi-way recursive methods can be very hard, in this paper we simply assume that such parallelism is always identified explicitly by means of annotations.
Thereafter, in section 3 we discuss how implicit parallelism in multi-way recursive methods can be made explicit.
www.extreme.indiana.edu /hpjava/papers/implicit/node1.html   (539 words)

  
 A 64-bit Instruction Set Architecture (ISA) Based on EPIC Technology   (Site not responding. Last check: 2007-10-30)
The new 64-bit ISA takes an innovative approach combining explicit parallelism with techniques called predication and speculation to progress well beyond the limitations of traditional architectures.
That’s the concept behind explicit parallelism: the compiler organizes code efficiently and makes the ordering explicit so that the processor can focus on executing instructions in the most effective manner.
The innovative use of predication and speculation uniquely combined with explicit parallelism has allowed EPIC technology to progress well beyond the limitations (like mispredicted branches and memory latency) of traditional architectures- enabling industry leading performance.
bwrc.eecs.berkeley.edu /CIC/otherpr/epic-info.html   (1360 words)

  
 [No title]
One key optimization that KAP performs is the parallelization of programs for Alpha shared memory multiprocessors that use the new capabilities of the DEC OSF/1 version 3.0 operating system with DECthreads.
Parallelism is represented at three levels in programs using the KAP preprocessor on an Alpha SMP system.
The KAP preprocessor optimizes programs for parallelism by searching for the optimum program in a set of possible configurations, i.e., ways in which the original program can be transformed for parallel execution.
www.hpl.hp.com /hpjournal/dtj/vol6num3/vol6num3art5.txt   (4252 words)

  
 ASYNCHRONY IN PARALLEL COMPUTING: FROM DATAFLOW TO MULTITHREADING
For this reason, the impact of the convergence of the dataflow and control-flow was investigated [16, 125, 127, 141, 169].
The new arrangement is necessary, since the operand fields in an instruction denote the offset in the memory frame that itself is addressed by the tag of a token.
While a single thread of control in modern microprocessors often does not incorporate enough fine-grained parallelism to feed the multiple functional units of todays microprocessors, dataflow resolves any threads of control into separate instructions that are ready to execute as soon as all required operands are available.
www-csd.ijs.si /silc/pdcp.html   (14669 words)

  
 TABLE OF CONTENTS   (Site not responding. Last check: 2007-10-30)
The IA-64 architecture is based on innovative techniques/features such as Explicit Parallelism, and Predication and Speculation, resulting in superior Instruction Level Parallelism (ILP) and increased instructions per cycle (IPC) to address the current and future requirements of these demanding Internet, high end server, and workstation applications.
Itanium is a parallel processor, so when writing code the programmer should try to design his algorithms so that they can be executed in parallel.
The programmer must avoid long sequences of code in which every line depends on the results of the prior line and he should try to break long calculations into segments that can be executed separately; this lets the optimizer interleave instructions for the segments to make the most use of each cycle.
www.ceng.metu.edu.tr /~e1298165   (5939 words)

  
 Abstract, Dissertations, Research, Computing Science, University of Newcastle
Implicit parallel programming is a desirable alternative to explicit parallelism, where the user must specify all aspects of the parallel computation.
However, for it to gain wide acceptance, implicit parallelism must be able to show explicit or near-explicit performance.
This dissertation is an investigation into the relative performance of the explicit message passing language MPI and the implicit distributed shared memory language NIPDSM, and a comparison of the coding effort required for each.
www.cs.ncl.ac.uk /research/pubs/dissertation/abstract.php?id=200   (231 words)

  
 Filaments-Related Publications
It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential.
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions.
Five specific techniques are considered: (1) implicitly coarsening the granularity of parallelism, (2) using implicit communication implemented by a distributed shared memory, (3) overlapping computation and communication, (4) adaptively moving threads and data between nodes to minimize communication and balance load, and (5) dynamically remapping data to pages to avoid false sharing.
www.cs.arizona.edu /people/filament/papers.html   (1208 words)

  
 GranSim User's Guide - Overview
This allows to carry results of a GranSim simulation over to a real parallel machine operating under GUM (this issue will be addressed in more detail in section GranSim vs GUM.).
Thus, this mode mainly shows the amount of parallelism in the program and indicates an upper bound of the parallelism when running the program on a real machine.
For the efficiency of the parallel program it is important to avoid unnecessary blocking during the execution.
www.dcs.gla.ac.uk /~hwloidl/fp-www/software/gransim/user_2.html   (1664 words)

  
 Algorithm + Strategy = Parallelism -- Fully-Explicit Approaches   (Site not responding. Last check: 2007-10-30)
More explicit approaches usually work at the lowest level of parallel control, providing sets of basic parallelism primitives that could then be exploited to build more complex structures such as evaluation strategies.
The approach is typified by MultiLisp [Halstead, 1985] or Mul-T [Kranz et al.
While this approach provides the essential building blocks needed to support evaluation strategies, it has the disadvantage of raising all parallel operations to the monad level, thus preventing the clean separation of algorithm and behaviour that is observed with either evaluation strategies or first-class schedules.
www.dcs.gla.ac.uk /~hwloidl/publications/Strategies/strategies_32.html   (144 words)

  
 Explicit Parallelism Based on Tuple Spaces (ResearchIndex)   (Site not responding. Last check: 2007-10-30)
If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Abstract: es like FCP [7] and Oz [6] add explicit mechanisms for synchronization and communication to the pure logic programming paradigm.
These languages are based mostly on a single basic model of parallel computation, called the stream-based process model: processes execute logic rules that can spawn new processes; processes communicate via streams; special constraints on writing and reading streams rule the synchronization among producer and consumer processes [7].
citeseer.ist.psu.edu /247795.html   (316 words)

  
 Paradigms for Parallel Processing   (Site not responding. Last check: 2007-10-30)
The evolution of parallel processing, even if slow, gave rise to a considerable variety of programming paradigms.
coordinate the parallel executions (e.g., specify and implement interactions between concurrent components).
It is custom to separate the approaches to parallel processing into explicit versus implicit parallelism.
www.cs.nmsu.edu /~epontell/adventure/node4.html   (94 words)

  
 No match for explicit parallelism   (Site not responding. Last check: 2007-10-30)
Sorry, the term explicit parallelism is not in the dictionary.
Nearby terms: explanandum « explanation « explicit memory « exponential » exponential-time » exponential-time algorithm » expressionism
Last modified: Sat Feb 17 16:22:35 GMT 2001
lgxserver.uniba.it /lei/foldop/foldoc.cgi?explicit+parallelism   (46 words)

  
 Skeletal Parallelism
Welcome to the `skeletal parallelism' homepage which collects a number of links on work related to the use of `skeletons' and similar ideas in the design, analysis, and implementation of algorithms and programming languages for parallel computers.
There are many definitions, but the gist is that useful patterns of parallel computation and interaction can be packaged up as `framework/second order/template' constructs (i.e.
There is a mailing list, with an archive, for the discussion of all skeleton-related matters.
homepages.inf.ed.ac.uk /mic/Skeletons   (200 words)

  
 explicit parallelism
Previous: Expert Systems Ltd. Next: explicit type conversion
A feature of a programming language for a parallel processing system which allows or forces the programmer to annotate his program to indicate which parts should be executed as independent parallel tasks.
This is obviously more work for the programmer than a system with implicit parallelism (where the system decides automatically which parts to run in parallel) but may allow higher performance.
burks.brighton.ac.uk /burks/foldoc/21/40.htm   (83 words)

  
 Multigame - A Very High Level Language for Describing Board Games - Romein, Bal, Grune (ResearchIndex)   (Site not responding. Last check: 2007-10-30)
Abstract: Languages with implicit parallelism are easier to program in than those with explicit parallelism, but finding and efficiently exploiting parallelism in general-purpose programming languages by parallelizing compilers is hard.
A compiler for a Very High Level Language, designed for a specific application domain, has more knowledge about its application domain and may use this knowledge to generate efficient parallel code without requiring the programmer to deal with explicit parallelism.
47 Panda: A portable platform to support parallel programming l..
citeseer.ist.psu.edu /147727.html   (463 words)

  
 AnandTech: Merced, EPIC, & IA64 Explained   (Site not responding. Last check: 2007-10-30)
This is known as EXPLICITLY PARALLELISM; the code is explicitly arranged to take advantage of parallelism.
Since the EPIC processor is based on the idea of explicit parallelism; this processor must be capable of processing lots of data in parallel.
EPIC processors have multiple instruction pipelines, generally many registers, wide data paths, and other special features such as Predication and Speculation to aid them in keeping the code highly "pipelineable" and to avoid stalls at all costs.
www.anandtech.com /html/review_display.cfm?document=274   (471 words)

  
 explicit parallelism - a definition from Whatis.com
- Explicit parallelism is a concept of processor-compiler efficiency in which a group of instructions is sent from the compiler to the processor for simultaneous rather than sequential execution.
Explicit parallelism is a feature of Explicitly Parallel Instruction Computing (EPIC) and Intel's EPIC-based architecture, IA-64.
Do you have something to add to this definition?
searchcio.techtarget.com /sDefinition/0,,sid19_gci214613,00.html   (139 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.