forked from hpcboston/hpcboston.github.io
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathworkloads.html
190 lines (177 loc) · 9.6 KB
/
workloads.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
<meta name="description" content="">
<meta name="author" content="">
<link rel="icon" href="/docs/4.0/assets/img/favicons/favicon.ico">
<title>Workloads</title>
<link rel="canonical" href="https://getbootstrap.com/docs/4.0/examples/starter-template/">
<!-- Bootstrap core CSS -->
<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/css/bootstrap.min.css"
integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous">
<!-- Custom styles for this template -->
<link href="workloads.css" rel="stylesheet">
</head>
<body>
<nav class="navbar navbar-expand-md navbar-dark bg-dark fixed-top">
<a class="navbar-brand" href="index.html">HPC Boston</a>
<button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#navbarsExampleDefault"
aria-controls="navbarsExampleDefault" aria-expanded="false" aria-label="Toggle navigation">
<span class="navbar-toggler-icon"></span>
</button>
<div class="collapse navbar-collapse" id="navbarsExampleDefault">
<ul class="navbar-nav mr-auto">
<li class="nav-item">
<a class="nav-link" href="index.html">Home <span class="sr-only">(current)</span></a>
</li>
<li class="nav-item">
<a class="nav-link" href="index.html#competition">Overview</a>
</li>
<li class="nav-item">
<a class="nav-link" href="workloads.html">Workloads</a>
</li>
<li class="nav-item">
<a class="nav-link" href="index.html#applications">Applications</a>
</li>
<li class="nav-item">
<a class="nav-link" href="index.html#logistics">Logistics</a>
</li>
<li class="nav-item">
<a class="nav-link" href="index.html#sponsors">Sponsors</a>
</li>
<li class="nav-item">
<a class="nav-link" href="index.html#contact">Contact</a>
</li>
</ul>
<form class="form-inline my-2 my-lg-0">
<a href="https://forms.gle/U1vVg4tDv9H2DaDH7" class="btn btn-outline-danger my-2 my-sm-0">Register</a>
</form>
</div>
</nav>
<main role="main">
<div class="starter-template home-block text-center">
<h1 class="display-4 "><strong>Workloads</strong></h1>
<br>
</div>
<div class "container-fluid">
<div id="competition" class="starter-template about-block">
<div class="border-box">
<h1>Workloads Overview</h1>
<p class="lead">During the competition, each team must run a variety of workloads.</p>
<p>Each team will be judged on their ability to run the workloads efficiently and accurately.</p>
</div>
</div>
<div id="workloads" class="starter-template workloads-block">
<div class="border-box">
<h1>HPCG Benchmark</h1>
<p class="lead">High Performance Conjugate Gradient (HPCG) is an industry standard benchmark designed to profile HPC systems.</p>
<p><a href="http://hpcg-benchmark.org">HPCG Benchmark</a> will be used to measure the raw
compute performance of your system. This benchmark is used as a metric to rank the <a
href="https://www.top500.org/hpcg/lists/2019/06/">TOP500</a> computer systems in the world.</p>
</div>
</div>
<div id="median" class="starter-template logistics-block">
<div class="border-box">
<h1>Median of Merged Array</h1>
<h5>Problem Description</h5>
<p>Given two unsorted arrays <i>A</i> and <i>B</i> of size <i>m</i> and <i>n</i> (respectively), your task to find the median value of the sorted array, obtained by the merge of input arrays <i>A</i> and <i>B</i>.</p>
<p>Note:</p>
<ul>
<li>
If the merged array has an even number of elements (i.e., is_even(<i>m</i>+<i>n</i>) == True), the median is the average
between the two center elements.
</li>
<li>
Two arrays will be provided in separate text files. Each element of the array is separated by a new line.
</li>
</ul>
<h5>Test Datasets</h5>
<a href="https://drive.google.com/drive/folders/1bqHVFnTy7Nk8aD2xG59QUhAnT7g6PrmL?usp=sharing" class="btn btn-xl btn-outline-danger" role="button">Download Median Dataset</a>
<p></p>
<h5>Additional Resources</h5>
<ul>
<li><a href="https://medium.com/@hazemu/finding-the-median-of-2-sorted-arrays-in-logarithmic-time-1d3f2ecbeb46">Medium - Finding the Median of 2 Sorted Arrays in Logarithmic Time</a></li>
</ul>
</div>
</div>
<div id="recipes" class="starter-template logistics-block">
<div class="border-box">
<h1>Standardizing Recipe Ingredients </h1>
<h5>Background</h5>
<p>The <a href="https://dominikschmidt.xyz/simplified-recipes-1M/">simplified-recipes-1M Dataset</a> by Dominik Schmidt
contains approximately 1,000,000 carefully cleaned and preprocessed recipes. The data comes from five different base datasets
which were merged in order to create a more complete recipe collection. All recipes have been meticulously cleaned and
standardized.</p>
<p>During the preprocessing step, Dominik faced a challenge: he needed to standardize the receipe ingredients.</p>
<h5>Problem Description</h5>
<p>Your task is to count the top 20 most used ingredients in an example dataset. You will be provided with a text file that lists recipe IDs and a string of ingredients.
You must then match the substrings against the dictionary of known ingredients and present the top 20 most used ingredients in our dataset.
</p>
<h5>Test Datasets</h5>
<a href="https://drive.google.com/drive/folders/1R1mPD4G_b4fbnqkFf5M04imqP9i9qG4v?usp=sharing" class="btn btn-xl btn-outline-danger" role="button">Download Recipe Dataset</a>
<p></p>
<ul></ul>
</div>
</div>
<div id="sponsors" class="starter-template timeline-block">
<div class="border-box">
<h1>Drilling Circuit Boards</h1>
<h5>Background</h5>
<p>Printed circuit boards (or PCB) are used by current generation electronic devices. Each PCB can have
hundreds to thousands of metalized holes called <a href="https://en.wikipedia.org/wiki/Via_(electronics)">vias</a>. During the
manufacturing process, each hole must be drilled once. Finding the most optimal way for an automatic drilling machine to visit each via
can significantly speed-up PCB production time.</p>
<h5>Problem Description</h5>
<p>Given the positions <i>(x,y)</i> of all of these vias, your task is to find the shortest tour for our drilling machine to visit all the vias once.</p>
<p>Note:</p>
<ul>
<li>
Our drilling machine can move diagonally. Thus, the euclidean distance metric should be used.
</li>
<li>
The final result should be within 1% of the optimal solution
</li>
</ul>
<h5>Test Datasets</h5>
<a href="https://drive.google.com/drive/folders/1eSs9zJJpO_aWMGFBwSfz_IslJaeghgwO?usp=sharing" class="btn btn-xl btn-outline-danger" role="button">Download Circuit Board Dataset</a>
<p></p>
<h5>Additional Resources</h5>
<ul>
<li><a href=https://developers.google.com/optimization/routing/tsp>Google Developers - Traveling Salesman
Problem</a> </li> </ul> </div> </div> <div id="sponsors" class="starter-template timeline-block">
<div class="border-box">
<h1>Mystery Application</h1>
<p class="lead">At the start of the competition, a new workload will be released. Competitiors will be
required to code,
compile, and run this workload during the competition along with the above workloads.</p>
</div>
</div>
<div id="contact" class="starter-template sponsors-block">
<div class="border-box">
<h1>Contact</h1>
<p class="lead">Questions? Email <a href="mailto:[email protected]"> [email protected]</a></p>
<h5>About NUCAR</h5>
<p> HPC Boston is being run by students from Northeastern University’s Computer Architecture Laboratory,
also known as NUCAR.
NUCAR conducts research in areas such as computer security, GPU computing, and embedded systems.
The lab is overseen by Professor David Kaeli. </p>
</div>
</div>
</div>
</main><!-- /.container -->
<!-- Bootstrap core JavaScript
================================================== -->
<!-- Placed at the end of the document so the pages load faster -->
<script src="https://code.jquery.com/jquery-3.2.1.slim.min.js"
integrity="sha384-KJ3o2DKtIkvYIK3UENzmM7KCkRr/rE9/Qpg6aAZGJwFDMVNA/GpGFF93hXpG5KkN"
crossorigin="anonymous"></script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/popper.js/1.12.9/umd/popper.min.js"
integrity="sha384-ApNbgh9B+Y1QKtv3Rn7W3mgPxhU9K/ScQsAP7hUibX39j7fakFPskvXusvfa0b4Q"
crossorigin="anonymous"></script>
<script src="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/js/bootstrap.min.js"
integrity="sha384-JZR6Spejh4U02d8jOt6vLEHfe/JQGiRRSQQxSfFWpi1MquVdAyjUar5+76PVCmYl"
crossorigin="anonymous"></script>
</body>
</html>