日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

代寫(xiě)COMP528、代做c/c++,Python程序語(yǔ)言

時(shí)間:2024-07-27  來(lái)源:  作者: 我要糾錯(cuò)



University of Liverpool Assignment 1 Resit COMP528
In this assignment, you are asked to implement 2 algorithms for the Travelling Salesman
Problem. This document explains the operations in detail, so you do not need previous
knowledge. You are encouraged to begin work on this as soon as possible to avoid the queue
times on Barkla closer to the deadline. We would be happy to clarify anything you do not
understand in this report.
1 The Travelling Salesman Problem (TSP)
The travelling salesman problem is a problem that seeks to answer the following question:
‘Given a list of vertices and the distances between each pair of vertices, what is the shortest
possible route that visits each vertex exactly once and returns to the origin vertex?’.
(a) A fully connected graph
(b) The shortest route around all vertices
Figure 1: An example of the travelling salesman problem
The travelling salesman problem is an NP-hard problem, that meaning an exact solution
cannot be solved in polynomial time. However, there are polynomial solutions that can
be used which give an approximation of the shortest route between all vertices. In this
assignment you are asked to implement 2 of these.
1.1 Terminology
We will call each point on the graph the vertex. There are 6 vertices in Figure 1.
We will call each connection between vertices the edge. There are 15 edges in Figure 1.
We will call two vertices connected if they have an edge between them.
The sequence of vertices that are visited is called the tour. The tour for Figure 1(b) is
(0, 2, 4, 5, 3, 1, 0). Note the tour always starts and ends at the origin vertex.
A partial tour is a tour that has not yet visited all the vertices.
2023-2024 1University of Liverpool Assignment 1 Resit COMP528
2 The solutions
2.1 Preparation of Solution
You are given a number of coordinate ffles with this format:
x, y
4.81263062736921, 8.34719930253777
2.90156816804616, 0.39593575612759
1.13649642931556, 2.27359458630845
4.49079099682118, 2.97491204443206
9.84251616851393, 9.10783427307047
Figure 2: Format of a coord ffle
Each line is a coordinate for a vertex, with the x and y coordinate being separated by a
comma. You will need to convert this into a distance matrix.
0.000000 8.177698 7.099481 5.381919 5.087073
8.177698 0.000000 2.577029 3.029315 11.138848
7.099481 2.577029 0.000000 3.426826 11.068045
5.381919 3.029315 3.426826 0.000000 8.139637
5.087073 11.138848 11.068045 8.139637 0.000000
Figure 3: A distance matrix for Figure 2
To convert the coordinates to a distance matrix, you will need make use of the euclidean
distance formula.
d =
p
(xi − xj )
2 + (yi − yj )
2
Figure 4: The euclidean distance formula
Where: d is the distance between 2 vertices vi and vj
, xi and yi are the coordinates of the
vertex vi
, and xj and yj are the coordinates of the vertex vj
.
2023-2024 2University of Liverpool Assignment 1 Resit COMP528
2.2 Smallest Sum Insertion
The smallest sum insertion algorithm starts the tour with the vertex with the lowest index.
In this case that is vertex 0. Each step, it selects a currently unvisited vertex where the
total edge cost to all the vertices in the partial tour is minimal. It then inserts it between
two connected vertices in the partial tour where the cost of inserting it between those two
connected vertices is minimal.
These steps can be followed to implement the smallest sum insertion algorithm. Assume
that the indices i, j, k etc; are vertex labels unless stated otherwise. In a tiebreak situation,
always pick the lowest index(indices).
1. Start off with a vertex vi.
4
Figure 5: Step 1 of Smallest Sum Insertion
2. Find a vertex vj such that
Pt=Length(partialtour)
t=0
dist(vt
, vj ) is minimal.
Figure 6: Step 2 of Smallest Sum Insertion
3. Insert vj between two connected vertices in the partial tour vn and vn+1, where n is a
position in the partial tour, such that dist(vn, vj ) + dist(vn+1, vj ) - dist(vn, vn+1) is
minimal.
4. Repeat steps 2 and 3 until all of the vertices have been visited.
2023-2024 3University of Liverpool Assignment 1 Resit COMP528
Figure 7: Step 3 of Smallest Sum Insertion
4
(a) Select the vertex
(b) Insert the vertex
Figure 8: Step 4 of Smallest Sum Insertion
(b) Insert the vertex
Figure 9: Step 5 of Smallest Sum Insertion
2023-2024 4University of Liverpool Assignment 1 Resit COMP528
4
(b) Insert the vertex
Figure 10: Step 6 of Smallest Sum Insertion
(a) Select the vertex
(b) Insert the vertex
Figure 11: Step 7 of Smallest Sum Insertion
2023-2024 5University of Liverpool Assignment 1 Resit COMP528
2.3 MinMax Insertion
The minmax insertion algorithm starts the tour with the vertex with the lowest index. In this
case that is vertex 0. Each step, it selects a currently unvisited vertex where the largest edge
to a vertex in the partial tour is minimal. It then inserts it between two connected vertices
in the partial tour where the cost of inserting it between those two connected vertices is
minimal.
These steps can be followed to implement the minmax insertion algorithm. Assume that the
indices i, j, k etc; are vertex labels unless stated otherwise. In a tiebreak situation, always
pick the lowest index(indices).
1. Start off with a vertex vi.
Figure 12: Step 1 of Minmax Insertion
2. Find a vertex vj such that M ax(dist(vt
, vj )) is minimal, where t is the list of elements
in the tour.
Figure 13: Step 2 of Minmax Insertion
3. Insert vj between two connected vertices in the partial tour vn and vn+1, where n is a
position in the partial tour, such that dist(vn, vj ) + dist(vn+1, vj ) - dist(vn, vn+1) is
minimal.
4. Repeat steps 2 and 3 until all of the vertices have been visited.
2023-2024 6University of Liverpool Assignment 1 Resit COMP528
Figure 14: Step 3 of Minmax Insertion
(a) Select the vertex
4
(b) Insert the vertex
Figure 15: Step 4 of Minmax Insertion
(a) Select the vertex
(b) Insert the vertex
Figure 16: Step 5 of Minmax Insertion
2023-2024 7University of Liverpool Assignment 1 Resit COMP528
(a) Select the vertex
4
(b) Insert the vertex
Figure 17: Step 6 of Minmax Insertion
(b) Insert the vertex
Figure 18: Step 7 of Minmax Insertion
2023-2024 8University of Liverpool Assignment 1 Resit COMP528
3 Running your programs
Your program should be able to be ran like so:
$ ./<program name >. exe <c o o r d i n a t e f i l e n a m e > <o u t p u t fil e n am e >
Therefore, your program should accept a coordinate file, and an output file as arguments.
Note that C considers the first argument as the program executable. Both implementations
should read a coordinate file, run either smallest sum insertion or MinMax insertion, and
write the tour to the output file.
3.1 Provided Code
You are provided with the file coordReader.c, which you will need to include this file when
compiling your programs.
1. readNumOfCoords(): This function takes a filename as a parameter and returns the
number of coordinates in the given file as an integer.
2. readCoords(): This function takes the filename and the number of coordinates as
parameters, and returns the coordinates from a file and stores it in a two-dimensional
array of doubles, where coords[i][0] is the x coordinate for the ith coordinate, and
coords[i][1] is the y coordinate for the ith coordinate.
3. writeTourToFile(): This function takes the tour, the tour length, and the output
filename as parameters, and writes the tour to the given file.
4 Instructions
• Implement a serial solution for the smallest sum insertion and the MinMax insertion.
Name these: ssInsertion.c, mmInsertion.c.
• Implement a parallel solution, using OpenMP,for the smallest sum insertion and the
MinMax insertion algorithms. Name these: ompssInsertion.c, ompmmInsertion.c.
• Create a Makefile and call it ”Makefile” which performs as the list states below. Without
the Makefile, your code will not grade on CodeGrade.
– make ssi compiles ssInsertion.c and coordReader.c into ssi.exe with the GNU
compiler
– make mmi compiles mmInsertion.c and coordReader.c into mmi.exe with the
GNU compiler
2023-2024 9University of Liverpool Assignment 1 Resit COMP528
– make ssomp compiles ompssInsertion.c and coordReader.c into ssomp.exe with
the GNU compiler
– make mmomp compiles ompmmInsertion.c and coordReader.c into mmomp.exe
with the GNU compiler
– make issomp compiles ompssInsertion.c and coordReader.c into issomp.exe with
the Intel compiler
– make immomp compiles ompmmInsertion.c and coordReader.c into immomp.exe
the Intel compiler
• Test each of your parallel solutions using 1, 2, 4, 8, 16, and 32 threads, recording
the time it takes to solve each one. Record the start time after you read from the
coordinates file, and the end time before you write to the output file. Do all testing
with the large data file.
• Plot a speedup plot with the speedup on the y-axis and the number of threads on the
x-axis for each parallel solution.
• Plot a parallel efficiency plot with parallel efficiency on the y-axis and the number of
threads on the x-axis for each parallel solution.
• Write a report that, for each solution, using no more than 1 page per solution,
describes: your serial version, and your parallelisation strategy.
• In your report, include: the speedup and parallel efficiency plots, how you conducted
each measurement and calculation to plot these, and screenshots of you compiling and
running your program. These do not contribute to the page limit.
• Your final submission should be uploaded onto CodeGrade. The files you
upload should be:
1. Makefile
2. ssInsertion.c
3. mmInsertion.c
4. ompssInsertion.c
5. ompmmInsertion.c
6. report.pdf
7. The slurm script you used to run your code on Barkla.
2023-2024 10University of Liverpool Assignment 1 Resit COMP528
5 Hints
You can also parallelise the conversion of the coordinates to the distance matrix. When
declaring arrays, it’s better to use dynamic memory allocation. You can do this by:
int ∗ o n e d a r ra y = ( int ∗) malloc ( numOfElements ∗ s i z e o f ( int ) ) ;
For a 2-D array:
int ∗∗ twod a r ra y = ( int ∗∗) malloc ( numOfElements ∗ s i z e o f ( int ∗ ) ) ;
for ( int i = 0 ; i < numOfElements ; i ++){
twod a r ra y [ i ] = ( int ∗) malloc ( numOfElements ∗ s i z e o f ( int ) ) ;
}
5.1 MakeFile
You are instructed to use a MakeFile to compile the code in any way you like. An example
of how to use a MakeFile can be used here:
{make command } : { t a r g e t f i l e s }
{compile command}
s s i : s s I n s e r t i o n . c coordReader . c
gcc s s I n s e r t i o n . c coordReader . c −o s s i . exe −lm
Now, on the command line, if you type ‘make ssi‘, the compile command is automatically
executed. It is worth noting, the compile command must be indented. The target files are
the files that must be present for the make command to execute.
This command may work for you and it may not. The point is to allow you to compile
however you like. If you want to declare the iterator in a for loop, you would have to add the
compiler flag −std=c99. −fopenmp is for the GNU compiler and −qopenmp is for the
Intel Compiler. If you find that the MakeFile is not working, please get in contact as soon
as possible.
Contact: h.j.forbes@liverpool.ac.uk
2023-2024 11University of Liverpool Assignment 1 Resit COMP528
6 Marking scheme
1 Code that compiles without errors or warnings 15%
2 Same numerical results for test cases (tested on CodeGrade) 20%
3 Speedup plot 10%
4 Parallel Efficiency Plot 10%
5 Parallel efficiency up to 32 threads (tests on Barkla yields good efficiency
for 1 Rank with 1, 2, 4, 8, 16, 32 OMP threads)
15%
6 Speed of program (tests on Barkla yields good runtime for 1, 2, 4, 8, 16,
32 ranks with 1 OMP thread)
10%
7 Clean code and comments 10%
8 Report 10%
Table 1: Marking scheme
The purpose of this assessment is to develop your skills in analysing numerical programs and
developing parallel programs using OpenMP. This assessment accounts for 40% of your final
mark, however as it is a resit you will be capped at 50% unless otherwise stated by the Student
Experience Team. Your work will be submitted to automatic plagiarism/collusion detection
systems, and those exceeding a threshold will be reported to the Academic Integrity Officer for
investigation regarding adhesion to the university’s policy https://www.liverpool.ac.uk/
media/livacuk/tqsd/code-of-practice-on-assessment/appendix_L_cop_assess.pdf.
7 Deadline
The deadline is 23:59 GMT Friday the 2nd of August 2024. https://www.liverp
ool.ac.uk/aqsd/academic-codes-of-practice/code-of-practice-on-assessment/
2023-2024 12

請(qǐng)加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp




 

標(biāo)簽:

掃一掃在手機(jī)打開(kāi)當(dāng)前頁(yè)
  • 上一篇:CIT 593代做、代寫(xiě)Java/c++語(yǔ)言編程
  • 下一篇:代寫(xiě)COMP4337、代做Python編程設(shè)計(jì)
  • 代做IERG 4080、代寫(xiě)Python程序語(yǔ)言
  • CS202代做、代寫(xiě)Java/Python程序語(yǔ)言
  • 代做SEHH2239、Python程序語(yǔ)言代寫(xiě)
  • COMP3334代做、代寫(xiě)Python程序語(yǔ)言
  • 代寫(xiě)COMP9021、代做Python程序語(yǔ)言
  • 昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲(chóng)
    油炸竹蟲(chóng)
    酸筍煮魚(yú)(雞)
    酸筍煮魚(yú)(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚(yú)
    香茅草烤魚(yú)
    檸檬烤魚(yú)
    檸檬烤魚(yú)
    昆明西山國(guó)家級(jí)風(fēng)景名勝區(qū)
    昆明西山國(guó)家級(jí)風(fēng)景名勝區(qū)
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗(yàn)證碼平臺(tái) 幣安官網(wǎng)下載 歐冠直播 WPS下載

    關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網(wǎng) 版權(quán)所有
    ICP備06013414號(hào)-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              欧美日韩在线一区| 亚洲视频国产视频| 国产精品一区二区你懂得| 久久国产视频网站| 一本在线高清不卡dvd| 精品91在线| 国产精品羞羞答答| 欧美视频一区| 欧美高清在线视频| 麻豆乱码国产一区二区三区| 亚洲一线二线三线久久久| 最新中文字幕一区二区三区| 国产综合欧美| 国产欧美一区二区三区另类精品| 欧美日韩国产探花| 欧美黄色一区二区| 美女精品一区| 免费在线观看日韩欧美| 久久精品99国产精品| 亚洲欧美在线一区| 亚洲香蕉视频| 在线亚洲美日韩| 亚洲最新视频在线| 夜夜嗨av一区二区三区网站四季av| 一区二区在线观看视频在线观看| 韩日精品视频| 极品少妇一区二区| 亚洲国产婷婷| 亚洲欧洲视频| 一本久久综合| 亚洲在线视频免费观看| 亚洲午夜羞羞片| 亚洲一区免费在线观看| 亚洲欧美偷拍卡通变态| 午夜激情一区| 久久成人羞羞网站| 久久综合99re88久久爱| 欧美夫妇交换俱乐部在线观看| 免费观看成人网| 欧美绝品在线观看成人午夜影视| 欧美精品videossex性护士| 欧美刺激性大交免费视频| 欧美日本一区二区高清播放视频| 欧美日精品一区视频| 国产乱子伦一区二区三区国色天香| 国产伦精品一区二区三区高清版| 国产日韩一区二区| 亚洲激情影院| 亚洲视频一区在线观看| 久久精品视频导航| 欧美日韩国产美| 国产精品尤物福利片在线观看| 国产欧美亚洲视频| 亚洲国产日韩欧美综合久久| 亚洲一区二区在线观看视频| 久久精品国产久精国产思思| 欧美xart系列高清| 国产日韩欧美高清| 亚洲狠狠婷婷| 午夜视频一区| 欧美国产日本在线| 国产一区二区成人| 一区二区三区导航| 玖玖玖国产精品| 欧美午夜视频| 亚洲激情欧美| 久久国产精品一区二区| 欧美美女bb生活片| 在线播放一区| 香蕉成人伊视频在线观看| 女人色偷偷aa久久天堂| 国产日韩欧美高清| 亚洲视频欧美在线| 欧美电影免费网站| 狠狠入ady亚洲精品| 亚洲天堂久久| 欧美日本亚洲| 91久久精品日日躁夜夜躁欧美 | 日韩亚洲精品在线| 久久香蕉国产线看观看av| 国产麻豆9l精品三级站| 日韩亚洲欧美高清| 欧美激情影音先锋| 亚洲风情亚aⅴ在线发布| 欧美在线二区| 国产伦精品一区二区三区视频孕妇| 日韩一区二区福利| 欧美激情一区二区三区全黄| 在线视频成人| 免费观看成人网| 在线观看日韩www视频免费| 久久久久久尹人网香蕉| 国产在线麻豆精品观看| 久久久精彩视频| 国产亚洲午夜| 久久久五月天| 亚洲高清视频在线| 欧美大片在线看| 亚洲精品色婷婷福利天堂| 欧美激情久久久久久| 日韩视频免费观看| 欧美视频中文在线看 | 亚洲精品日韩欧美| 欧美激情亚洲自拍| 亚洲精品中文在线| 国产精品久久久久婷婷| 亚洲视频欧洲视频| 国产欧美日韩高清| 鲁大师成人一区二区三区| 亚洲国产日韩在线| 欧美日本在线视频| 亚洲综合视频一区| 国产一区在线观看视频| 久久久久国产成人精品亚洲午夜| 在线日韩中文| 欧美午夜视频网站| 西西人体一区二区| 亚洲国产精品视频| 国产精品扒开腿做爽爽爽软件| 亚洲欧美日韩国产精品| 伊人夜夜躁av伊人久久| 欧美精品999| 午夜精品久久久久久久| 樱花yy私人影院亚洲| 欧美视频在线一区| 久久精品一区中文字幕| 91久久在线播放| 国产精品呻吟| 美女日韩欧美| 午夜精彩国产免费不卡不顿大片| 在线精品国产欧美| 国产精品一区免费观看| 免费观看成人www动漫视频| 一区二区三区|亚洲午夜| 国产综合久久| 国产精品久久999| 欧美成人综合在线| 欧美一区二区三区在线观看视频 | 国内精品**久久毛片app| 欧美日韩在线三区| 久久综合九色综合欧美狠狠| 中文精品一区二区三区| 亚洲国产精品一区二区久| 国产精品影片在线观看| 欧美日韩国产成人在线观看 | 国产伦精品一区二区三区在线观看| 久久久国产一区二区| 亚洲女性喷水在线观看一区| 亚洲国产精品久久久久久女王| 国产毛片精品视频| 欧美国产激情| 欧美在线免费观看| 亚洲综合色在线| 在线视频欧美精品| 99精品免费网| 日韩性生活视频| 亚洲国产精品一区二区久| 国产一区二区三区久久精品| 国产精品久久久久久久浪潮网站 | 亚洲人成在线免费观看| 一区在线观看| 在线看日韩av| 一区二区亚洲精品| 黑人操亚洲美女惩罚| 国产综合香蕉五月婷在线| 国产婷婷色一区二区三区| 国产精品无码专区在线观看| 欧美涩涩网站| 国产精品女主播| 国产欧美日韩另类视频免费观看| 国产精品制服诱惑| 国产精品自在在线| 国模精品一区二区三区| 国产一区视频在线看| 国内精品国产成人| 在线观看一区二区精品视频| 在线日韩一区二区| 日韩亚洲国产欧美| 在线视频一区观看| 翔田千里一区二区| 久久躁狠狠躁夜夜爽| 欧美电影免费观看网站| 欧美日韩一区视频| 国产性天天综合网| 在线精品福利| 一本一道久久综合狠狠老精东影业| 亚洲一级电影| 久久久久久久高潮| 欧美激情精品久久久久久变态| 欧美体内she精视频| 国产日韩欧美自拍| 亚洲福利视频网| 中日韩美女免费视频网址在线观看| 午夜久久美女| 免费毛片一区二区三区久久久| 欧美日韩理论| 国产一区二区黄色| 一区二区高清视频| 巨胸喷奶水www久久久免费动漫| 欧美精品日韩三级|