Executing a parallel algorithm, Computer Engineering

Assignment Help:

Q. Executing a parallel algorithm?

Multiple processors need synchronization with one another when executing a parallel algorithm. So task which is running on processor X may have to wait for result of a task which is executing on processor Y. As a result a delay is engaged in completing whole task distributed among K number of processors.


Related Discussions:- Executing a parallel algorithm

Explain the types of computer architecture, Explain the types of computer a...

Explain the types of computer architecture Computer architecture can be divided into three main categories: Instruction Set Architecture, or ISA, is the image of a computing

Explain passing parameters using pointers, Q. Explain Passing Parameters Us...

Q. Explain Passing Parameters Using Pointers ? This method overcomes the drawback of using variable names directly in procedure. It uses registers to pass procedure pointers to

Explain different system calls for performing different task, Write down di...

Write down different system calls for performing different kinds of tasks. The major types of system calls are given as: Process Control: These kinds of system calls are

What do you mean by e-cash, What do you mean by E-cash? E-Cash and it...

What do you mean by E-cash? E-Cash and its Properties:  Ecash is cash which is represented by two models. One is the on-line form of e-cash which allows for the completi

What do you mean by drive cache, Q. What do you mean by Drive Cache? Di...

Q. What do you mean by Drive Cache? Disk cache may be a part of RAM sometimes known as soft disk cache which is used to speed up access time on a disk. In latest technologies s

Amdahls law - calculate speed up performance, To calculate speed up perform...

To calculate speed up performance various laws have been developed. These laws are discussed here.  Amdahl's Law Remember, the speed up factor helps us in knowing the relat

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

What is indexing, What is indexing? Specific fields shown on each scann...

What is indexing? Specific fields shown on each scanned document are provided to our organization to make the systematic arrangement of your records. This process is designed t

Dynamic address translation - computer architecture, Dynamic address transl...

Dynamic address translation :  If, when executing an instruction, a CPU fetches an instruction located at a specific virtual address, or fetches data from a particular virtual

Functions for mpi environment, Q. Functions for MPI Environment? Int M...

Q. Functions for MPI Environment? Int MPI_Finalize (void) It ends the MPI environment. Any MPI function cannot be called after MPI_Finalize. Each MPI process belongs to on

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd