> make CC=kremlin-gcc > ./demo data.large.txt > kremlin --planner=openmp PlannerType = OpenMP Target : NumCore = 4, Overhead = 0, Cache = 0 MB, BW= 0 MB/s Speedup: 4.00 Serial : 182 Parallel: 45 [ 0] TimeRed(4)=62.23%, TimeRed(Ideal)=75.27%, Cov=82.97%, SelfP=10.79, DOALL LOOP main.c [ 19 - 23]: main [ 1] TimeRed(4)=12.77%, TimeRed(Ideal)=15.93%, Cov=17.03%, SelfP=15.50, DOALL LOOP main.c [ 11 - 13]: main ...In the above example, the tool identified two loops (lines 19-23 in main, and lines 11-13 in main) that could be parallelized. The first loop would result in a 62 percent time reduction if parallelized on 4 cores, and 75 percent if parallelized on an infinite core zero-overhead machine. It has 82 percent of the execution time, and the inherent parallelism of the loop is 10.79X, and the loop is DOALL.
Please see our official Bitbucket page for instructions on how to build and run Kremlin.git clone firstname.lastname@example.org:elsaturnino/kremlin.git
Kremlin has been tested on Mac OS X (10.9 and 10.10) and RHEL 7 but should work well on any modern Linux distribution.
If you have any questions, please contact Kremlin team members Sat Garcia or Michael Taylor at the following google group: kremlin-questions AT googlegroups.com. If you have any issues using Kremlin, we recommend that you report them on our official Bitbucket page.
|Prof. Sat Garcia||Donghwan Jeon||Chris Louie||Prof. Michael Taylor|
|09/10/2015||Kremlin is now officially available to the public! The official Kremlin repository is available on BitBucket.|
|4/14/2011||Sat and DJ are award best Computer Science and Engineering Poster at the 2011 Jacobs School Engineering Expo!|
|2/15/2011||Sat and DJ win best poster award at PPoPP 2011!|
(They were working on a grant proposal during the awards session
and another UCSD student had to receive it for them!)
|11/30/2009||Chris wins a 2010 CRA Outstanding Undergraduate Researcher Award honorable mention based on his research on the Kremlin project. Congrats, Chris!|