User Account

All Pages

Why the algorithm has been selected

Assignment Help Data Structure & Algorithms
Reference no: EM131479625

Assignment: Theoretical parallelization

1. The serial algorithm

The goal of this first part is to identify a problem that is of the interest to the student that can be parallelized: what is solves, what inputs needs, what generates, it computational cost and what parts of it can be potentially parallelized.

1.1 Describe what the selected algorithm does (include the references that you have used):
1.1.1 Why the algorithm has been selected?
1.1.2 Inputs, outputs and pseudo-code describing the algorithm. The pseudo-code must contain comments on what each important part of it is doing.
1.2 Describe what parts of the algorithm can be potentially parallelized.

2. Parallel implementation

The goal of this second part is to propose a pseudo-code parallel implementation for the parts identified in 1.2.
2.1 There are any existing solutions? Briefly describe their approaches. List the references.
2.2 Describe in pseudo-code a two potential parallel implementations for this algorithm:
2.2.1 What strategy have you selected? (i.e: pipeline, shared memory, message passing etc.) Why?
2.2.2 What other options you could use?
2.2.3 If possible, can you compare your proposal with the existing solutions proposed in 2.1?
2.2.4 Describe the pseudo-code including comments on why the different parallel selected parts.

3. Performance projection

3.1 Given the pseudo-code proposed in 2.2 and 1.1 propose a theoretical model to project the speedup that the parallel implementation may show with respect to the serial implementation. (It's a model so it's not expected to provide 100% accuracy).

3.1.1 Extra: Can you compare your proposed solutions with one of the existing solutions identified in 2.1?

3.2 Provide a speedup analysis using the previous model for: 1, 2, 4, 16 and 32 threads.

3.3 Provide a description of what type of computational system would be better for the provided implementation and what components would be important to invest more.

Reference no: EM131479625

Questions Cloud

Nonrecoverable investment in specialized assets : A firm must decide whether to make a component part in-house or to contract it out to an independent supplier.
Good job selection is a critical management task because : Good job selection is a critical management task because: What is selection?
How many bytes are required to store n data items : How many bytes are required to store N data items in each of these three structures: array based list, linked list, and doubly linked list?
Explain how a team is different than group : Please explain how a team is different than a "group" and explain when each would be appropriate.
Why the algorithm has been selected : Why the algorithm has been selected? Describe what parts of the algorithm can be potentially parallelized. What other options you could use?
Research situational leadership-diversity : Your paper should begin with an explanation of the traits with at least three references. Next you should select an individual that meets each assigned trait.
Area ties into the concept of supply and demand : The _____________ in the area ties into the concept of supply and demand.
Discuss about a period of growing sectionalism : The early 19th century: a time of nationalism, American unity, and strength or a period of growing sectionalism.
Explain fundamental information security concepts : Task IoT security is concerned with safeguarding connected devices and networks in the Internet of things (IoT) environment. Research the issue of IoT security.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Discuss how insertion sort and selection sort works

Pick one of the following sorting algorithms and discuss how it works, its main features including performance characteristics: Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Merge Sort, Quick Sort.

  Write a class to represent a dynamically sized array

Write a class to represent a dynamically sized array of integers. Name it DynArray. An integer representing the array size (allocated space) - an integer representing the amount of data stored in the array Public member functions:

  Select a task that a program could perform over an array

Select a task that a program could perform over an array of items that would be used by a small business. You can build on your effort from a previous week or tackle a new challenge.

  Create algorithm to calculte and print average earnings

Create the algorithm to calculte and print average earnings, lowest earnings, and highest earnings of group of employees. Each input record will contain name and earnings of one employee.

  Write a program that sorts an array of random numbers

Write a program that sorts an array of random numbers, using the shell sort and the quick sort. Both sorts should use the same data. Each sort should be executed twice.

  Identify ambiguities or omissions in the following statement

If customer confirms, system issues a confirmation number that customer can use to retrieve car at start date.

  Unctions for doing sort, search, display, replace, delete

create functions for doing sort, search, display, replace, delete, and add. You can use dynamic memory allocation for enlarge the size of pointer array for adding a new country.

  Explaining playout delay algorithm

Let the adaptive playout delay algorithm. Show through simple example that adjusting playout delay at beginning of each talk.

  Describe the osi reference model and tcpip protocol

in this assignment you will be in the role of dave baker the senior system administrator from minnesota consulting

  Compare three implementations for a priority queue

Compare and contrast three implementations for a priority queue in terms of what the data structures represent; a sketch of the principal routines.

  Implementing the banker algorithm

Prompt user to enter the size of matrix n and m. Your program should accept any n x m matrix and m vectors where n and m are positive integer less than ten.

  Creating a unix shell script

Design a Unix shell script that searches for a text document with most occurrences of a given keyword. For instance, if I would like to search for a script with most usages of if statement,

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +1-415-670-9521

Phone: +1-415-670-9521

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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