parallel computing

(redirected from Parallel machine)
Also found in: Dictionary.
Related to Parallel machine: Parallel Virtual Machine

parallel computing

parallel computing

Solving a problem with multiple computers or computers made up of multiple processors. It is an umbrella term for a variety of architectures, including symmetric multiprocessing (SMP), clusters of SMP systems, massively parallel processors (MPPs) and grid computing. See SMP, MPP, clustering, pipeline processing, vector processor, hypercube and grid computing.
References in periodicals archive ?
4, where Machine 4 stands for the first parallel machine in Operation 2, Machine 5 stands for the second parallel machine in Operation 2, Machine 6 stands for the first parallel machine in Operation 3 and Machine 7 stands for the second parallel machine in Operation 3 (see Fig.
15] first presented B&B method for the two-and three-stage HFS with uniform parallel machines, and the other kinds of B&B methods have been proposed for the general HFS problem with any amount of stages and parallel machines in many references [16-18].
Akhshabi [17] found a uniform parallel machine scheduling problem which is to minimize the maximum lateness.
Single And Parallel Machine Capacitated Lotsizing And Scheduling: New Iterative Mip-Based Neighborhood Search Heuristics.
In this section, we give an algorithm to solve the parallel machine problem P2 [absolute value of [r.
Research in identical Parallel Machine Scheduling problems has predominantly been concerned with minimization of make span or total completion time [1].
Electric plasticising was fitted to enable parallel machine functions, which helped to further reduce cycle times.
On parallel machine level, the communication topology hardly affects application performance.
Additionally, since some of these software tools are available only for specific systems, they need to be reconfigured anytime work is moved to a new parallel machine.
There are another dozen communications processors that link to the HyperTransport buses on the Opterons to provide a high-speed link to the switching fabric that connects all of the shelves in a massively parallel machine to each other.
One of the basic observations for this result is that in the absence of nontrivial release dates the parallel machine problem can be reduced to an assignment problem of jobs to machines; for a given assignment of jobs to machines the sequencing of the assigned jobs can be done optimally on each machine i by applying Smith's ratio rule [Smith 1956]: schedule the jobs in order of nonincreasing ratios [w.
The parallel machine scheduling is an allocation of one time interval on one of the machines.

Full browser ?