Technical Brief- 32 Core Testing Plan Contest
The purpose of this work is to develop and implement an effective algorithm to find automorphism groups of different algebraic and combinatorial objects in n-dimensional vector space over finite field. We use the First String Method (FSM) to deal with the automorphism groups used in cryptography and coding theory.
This year, a simple matrix multiplication problem was posed to the students and we set up an internal contest, to obtain the fastest serial code. Many versions were submitted, and we finally obtained 20x of improvement over the most naïve implementation. The students learned a lot about compiler optimizations, and above all, the effect of the caches in the performance of the code.
Using X services on the Intel(R) Manycore Testing Lab is unsupported, yet possible. This article demonstrates in general and in detail the four necessary steps to run X on the server:
1) Make a standard, character-based connection
2) Run the required software on the server
3) Run your secure PCX server software
4) Make the connection
Two secure PCX server solutions are discussed.
Using the Intel® Manycore Testing Lab researchers were able to scale investigations previously done on quad-core processors to 32 cores. Results were unexpected and open up several lines of speculation for further optimization tests in the future.
Parallel Minimum Spanning Tree Algorithm
|Article / White paper||