Sid Meier’s Civilization* series has a successful 20-year history. This white paper describes how Firaxis utilized Intel® GPA to ensure Civilization V (Civ5) offers the best possible mix of graphics & game performance for the vast majority of systems.
tbb
Ultrabook Part 2: Intel® VTune™ Amplifier XE 2011 with Windows 8* and Visual Studio* 2012 RC
As I continue to explore different Ultrabook capabilities, in this blog I decided to look into a powerful threading and performance optimization tool for C/C++, .NET, and FORTRAN developers who need to understand an application's serial and parallel behavior to improve performance and scalability: Intel® VTune™ Amplifier XE 2011.
Introducing Intel Ultrabook™ – Part One
In all my years in college I have used a laptop PC. Recently, I’ve been tempted to get a MacBook Air Pro because of its light-weight and stylish look. But, since starting at Intel, I’ve been able to explore and play with an Ultrabook and it has changed my mind completely. The reason is simple: Ivy Bridge Ultrabooks are just amazing! Ultrabooks will be even more amazing when you add the touch screen capability of Window 8 later this year.
Parallel algorithm for Radix Sort(Yuanyang Wu)
The included source code implements a parallel Radix Exchange Sort algorithm, as described in the included problem description text file. Two separate approaches are described and analyzed in the solution write-up. The code uses Intel Threading Building Blocks (TBB) parallel algorithms parallel_for and parallel_reduce to implement the parallelism. The code was intended for Windows OS and includes Microsoft Visual Studio solution and project files to build the application.
Parallel solution to Hosoya Index of Graph Problem (Vyukov)
The included code and white paper provides a parallel solution for the Hosoya Index problem, as described in the included problem description text file. The serial code uses the idea of a “sparsest cut” of an input graph. The sparsest cut divides edges of the graph into 3 sets: edges that are a part of the cut, and 2 mutually independent sets. From all matchings in the cut, the index value of the two other subsets can be computed recursively. Parallelism is achieved using Intel Threading Building Blocks.
Parallel solution to Hosoya Index of Graph Problem (Uelschen)
The included code and white paper provides a parallel solution for the Hosoya Index problem, as described in the included problem description text file. Parallelism is achieved using Intel Threading Building Blocks.
DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.
Parallel Solution to Betweenness of graph problem (Vyukov)
Betweenness is a metric applied to a vertex within a weighted graph. For the purposes of this problem we will define betweenness of vertex T as the number of shortest paths between two vertices in the graph that includes the vertex T, but does not start or end with vertex T.
Parallel algorithm to solve Maximum Independent Set problem (Trouger, Zhejiang University)
The included source code finds a Maximum Independent Set (MIS) of a given graph, as described in the included problem description text file. The solution uses a modification to a max-clique algorithm found in a code library from University of Jilin, China. The algorithm uses a depth-first search component. This part of the algorithm is parallelized by assigning several recursive calls to the depth-first code on threads. The code is parallelized using Windows Threads.
Parallel Algorithm to Solve Maximum Independent Set Problem
The included source code finds a Maximum Independent Set (MIS) of a given graph, as described in the included problem description text file. The parallel solution uses Intel Threading Building Blocks (TBB) tasks to execute a recursive search algorithm. Task continuation and recycling are utilized to bypass the task scheduler. The code was intended for Linux OS and includes a makefile to build the applications.
Parallel algorithm to solve a Hamiltonian Path problem variation (Travelling Baseball Fan) (Nicola Beschin)
The included source code implements a variation of the Hamiltonian Path problem, called the Travelling Baseball Fan Problem, as described in the included problem description text file. The serial algorithm is a recursive search of all potential paths. The parallelization was done with Intel Threading Building Blocks (TBB). Continuation tasks are set up for each tour day and parallel searches are executed within each new start day for the recursive algorithm to a given task generation depth. If there is no schedule for a day, the task for the next day is begun.
页面
