FACTOID # 2: Puerto Rico has roughly the same gross state product as Montana, Wyoming and North Dakota combined.
 
 Home   Encyclopedia   Statistics   States A-Z   Flags   Maps   FAQ   About 
   
 
WHAT'S NEW
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Parallel algorithm

In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is one which can be executed a piece at a time in many different processing devices, and then put back together again at the end to get the correct result. Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: | ... Flowcharts are often used to represent algorithms. ...


Some algorithms are easy to divide up into pieces like this. For example, splitting up the job of checking all of the numbers from one to a hundred to see if it is divisible by seven could be done by assigning a subset of the numbers to each available processor, and then putting the list of positive results back together.


Most of the available algorithms to compute Pi, on the other hand, could not be easily split up into parallel portions. Most of them require the results from a preceding step to effectively carry on with the next step. Lower-case pi The mathematical constant π is a real number which may be defined as the ratio of a circles circumference (Greek περιφέρεια, periphery) to its diameter in Euclidean geometry, and which is in common use in mathematics, physics, and engineering. ...


Parallel algorithms are valuable because it is faster to perform large computing tasks via a parallel algorithm than it is via a serial (non-parallel) algorithm, because of the way modern processors work. It is far more difficult to construct a computer with a single fast processor than one with many slow processors with the same throughput. There are also certain theoretical limits to the potential speed of serial processors. In information technology, throughput is the rate at which a computer or network sends or receives data. ...


A subtype of parallel algorithms, distributed algorithms are algorithms designed to work in cluster computing and distributed computing environments, where additional concerns beyond the scope of "classical" parallel algorithms need to be addressed. In computer science, a distributed algorithm is an algorithm that executes on more than one machine or processor. ... Linux Cluster at Purdue University A computer cluster is a group of locally connected computers that work together as a unit. ... In computer science, distributed computing studies the coordinated use of physically distributed computers. ...


See also: multiple agent system (MAS), neural network A multiple agent system (MAS) is a distributed parallel computer system built of many very simple components, each using a simple algorithm, and each communicating with other components. ... Simplified view of an artificial neural network A neural network is an interconnected group of biological neurons. ...


External links

  • Parallel Algorithm Design
  • Designing and Building Parallel Programs page at the US Argonne National Laboratories

  Results from FactBites:
 
Spartanburg SC | GoUpstate.com | Spartanburg Herald-Journal (536 words)
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is one which can be executed a piece at a time on many different processing devices, and then put back together again at the end to get the correct result.
Parallel algorithms are valuable because it is faster to perform large computing tasks via a parallel algorithm than it is via a serial (non-parallel) algorithm, because of the way modern processors work.
A subtype of parallel algorithms, distributed algorithms are algorithms designed to work in cluster computing and distributed computing environments, where additional concerns beyond the scope of "classical" parallel algorithms need to be addressed.
Parallel algorithm Summary (1312 words)
Parallel algorithms running on many machines thus are required--by partitioning the large problem among many processors (such as by allocating large chunks of the three-dimensional segment space to them for individual processing), problems such as weather forecasting may be solved.
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is one which can be executed a piece at a time on many different processing devices, and then put back together again at the end to get the correct result.
Parallel algorithms are valuable because it is faster to perform large computing tasks via a parallel algorithm than it is via a serial (non-parallel) algorithm, because of the way modern processors work.
  More results at FactBites »

 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m