Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Parallella: The Most Energy Efficient Supercomp...

Parallella: The Most Energy Efficient Supercomputer on the Planet

Presented at Madison+ Ruby on Saturday, August 22, 2015.
Video: http://rayhightower.com/blog/2015/08/22/madison-ruby-and-parallella/

Supercomputing should be available for everyone who wants it. With that mission in mind, a team of engineers created Parallella, an 18-core supercomputer that’s a little bigger than a credit card. Parallella is open source hardware; the circuit diagrams are on GitHub and the machine runs Linux. Icing on the cake: Parallella is the most energy efficient computer on the planet, and you can buy one for a hundred bucks.

Why does parallel computing matter? How can developers use parallel computing to deliver better results for clients? Let’s explore these questions together.

Curious about the Internet of Things? Check out http://WindyCityThings.com.

Ray Hightower

August 22, 2015
Tweet

More Decks by Ray Hightower

Other Decks in Technology

Transcript

  1. Madison+ Ruby Madison, WI, USA August 21-22, 2015 The Most

    Energy Efficient Supercomputer on the Planet
  2. Moore’s Law: 2x every 18 months Moore’s Law 1993 -

    2013 http://www.washingtonpost.com/blogs/innovations/wp/2015/04/14/10-images-that-explain-the- incredible-power-of-moores-law/ https://www.parallella.org/board/
  3. If one ox could not do the job they did

    not try to grow a bigger ox, but used two oxen. When we need greater computer power, the answer is not to get a bigger computer, but to build systems of computers and operate them in parallel. -Grace Hopper
  4. 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include <math.h> 4

    #include <time.h> 5 6 #define DEFAULT_MAX_TESTS 16000000 7 8 inline int isprime(unsigned long number) 9 { 10 unsigned long i; 11 unsigned long s = sqrt(number); 12 for(i=3;i<=s;i+=2) 13 { 14 if(number % i == 0) 15 return 0; 16 } 17 return 1; 18 } /* Copyright (c) Adapteva, contributed by M. Thompson with modifications by T. Malthouse. */
  5. 8 inline int isprime(unsigned long number) 9 { 10 unsigned

    long i; 11 unsigned long s = sqrt(number); 12 for(i=3;i<=s;i+=2) 13 { 14 if(number % i == 0) 15 return 0; 16 } 17 return 1; 18 } /* Copyright (c) Adapteva, contributed by M. Thompson with modifications by T. Malthouse. */
  6. 27 #include <e-hal.h> 28 29 // Default max number of

    prime tests per core 30 // Used if a limit it not provided in argv[1] 31 #define DEFAULT_MAX_TESTS 500000 32 33 int main(int argc, char *argv[]) 34 { 35 unsigned row, col, coreid, i, j; 36 e_platform_t platform; 37 e_epiphany_t dev; 38 /* Copyright (c) Adapteva, contributed by M. Thompson with modifications by T. Malthouse.*/
  7. Serial/Parallella: Serial/Mac: Parallel/Parallella: 237.1 sec 14.4 sec 18.6 sec Summary:

    Finding Primes 18 cores (using one). Up to 1GHz. $150.00 4 cores (using one). 2.7GHz. $2,000.00 18 cores. Up to 1GHz. $150.00