In the jargon of parallel computing, an embarrassingly parallel workload (or embarrassingly parallel problem) is one for which no particular effort is needed to segment the problem into a very large number of parallel tasks, and there is no essential dependency (or communication) between those parallel tasks. Parallel computing is the simultaneous execution of the same task (split up and specially adapted) on multiple processors in order to obtain faster results. ...

In other words, each step can be computed independently from every other step, thus each step could be made to run on a separate processor to achieve quicker results.

Examples of embarrassingly parallel problems include:

• non-real-time rendering of computer graphics
• brute force searches in cryptography
• game tree traversal in artificial intelligence
• ray tracing

Embarrassingly parallel problems are ideally suited to distributed computing over the Internet (eg. SETI@home), and are also easy to perform on server farms which do not have any of the special infrastructure used in a true supercomputer cluster. Rendering has several different usages: Computer rendering Artistic rendering Kitchen rendering Industrial rendering This is a disambiguation page — a navigational aid which lists other pages that might otherwise share the same title. ... Computer graphics (CG) is the field of visual computing, where one utilizes computers both to generate visual images synthetically and to integrate or alter visual and spatial information sampled from the real world. ... In computer science, a brute-force search consists of systematically enumerating every possible solution of a problem until a solution is found, or all possible solutions have been exhausted. ... See also: Topics in cryptography The security of all practical encryption schemes remains unproven, both for symmetric and asymmetric schemes. ... In game theory, a game tree is a directed graph whose nodes are positions in a game and whose edges are moves. ... In computer science, tree traversal is the process of visiting each node in a tree data structure. ... Artificial intelligence (also known as machine intelligence and often abbreviated as AI) is intelligence exhibited by any manufactured (i. ... A ray traced scene. ... Distributed computing is the process of aggregating the power of several computing entities to collaboratively run a single computational task in a transparent and coherent way, so that they appear as a single, centralized system. ... SETI@home under classic client (version 3. ... A typical server farm. ... The Cray-2; worlds fastest computer 1985–1989. ...

See also

• Amdahl's law