Posted: October 22nd, 2022

# Cse 525 | Computer Science homework help

The genome of an organism can be expresses as some number G of
“base pairs” (see http://en.wikipedia.org/wiki/Base_pair). Typical
sizes of various genomes are given in (http://en.wikipedia.org/wiki/Genome).

Save Time On Research and Writing
Hire a Pro to Write You a 100% Plagiarism-Free Paper.

String matching can be used to find particular sequences in a
genome. Several string matching algorithms are described
in (http://en.wikipedia.org/wiki/String_matching)

Consider a program to find to find if a particular sequence of
base pairs is found in a genome, and if so, where and how
many times.

Your program will run on a cluster with
the following properties:

Number of nodes – 20

Save Time On Research and Writing
Hire a Pro to Write You a 100% Plagiarism-Free Paper.

Number of processors per node 16 2.6 GHz Xeon
Memory per node               16 GB
GPU – 2 (NVIDIA CUDA) per node, 1024 stream processors and 4GB RAM, running at 1.5 GHz
local drives 1 T SATA , 6 GB/sec
NFS drive 10TB  RAID, bandwidth limited by network

Switched Ethernet network
Latency               L = 20 microseconds
Bandwidth             B = 1Gb/sec == 100 Mbytes/sec for messages
larger than 32Kbytes

You may not need all the above information. If you feel you need some other system
property, feel free to assume some reasonable value (Try Wikipedia)

Assume the genome you are exploring and the sequence you are
trying to find, are both initially files on the NFS disk.

Deliverables:

1. Parallel String Match algorithm – in MPI, OpenMP, CUDA or some
combination of these. Description in English and/or pseudocode is
sufficient. Is yoyur algorithm data parallel, task parallel or both?

Describe data transfer during computation (disk to program, process to process,
CPU – GPU and node – node). Describe how data is partitioned between processes,
shared between processes, or replicated at each process.

2. You may not need all the hardware available for your algorithm. You may use the
entire cluster or any part of it. Describe what resources your algorithm will use to

3. Estimate how your algorithm would perform on the computer
system described above. Consider:
a. Complexity; communication costs.
b. Is there some file size (in bytes, number of elements, or both)
that is too small for your algorithm to work efficiently? Given the wide range of genome
sizes (see http://en.wikipedia.org/wiki/Genome), is there some range of size that you expect would
c. How much speedup would you exepect on the given hardware as compared to running

### Expert paper writers are just a few clicks away

Place an order in 3 easy steps. Takes less than 5 mins.

## Calculate the price of your order

You will get a personal manager and a discount.
We'll send you the first draft for approval by at
Total price:
\$0.00
affordablepaperwritings.com
Hello!
You Can Now Place your Order through WhatsApp

Order your essay today and save 30% with the discount code DISCOUNTS2022