com.aparapi.examples.mapreduce.Main Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of aparapi-examples Show documentation
A collection of examples for the aparapi framework.
The newest version!
/**
 * Copyright (c) 2016 - 2018 Syncleus, Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.aparapi.examples.mapreduce;

import com.aparapi.Kernel;
import com.aparapi.Range;

import java.util.Arrays;

/**
 * Main class.
 *
 * @author freemo
 * @version $Id: $Id
 */
public class Main {
    /**
     * main.
     *
     * @param args an array of {@link java.lang.String} objects.
     */
    public static void main(String[] args) {
        int size = 1048576;
        final int count = 3;
        final int[] V = new int[size];

        //lets fill in V randomly...
        for (int i = 0; i < size; i++) {
            //random number either 0, 1, or 2
            V[i] = (int) (Math.random() * 3);
        }

        //this will hold our values between the phases.
        int[][] totals = new int[count][size];

        ///////////////
        // MAP PHASE //
        ///////////////
        final int[][] kernelTotals = totals;
        Kernel mapKernel = new Kernel() {
            @Override
            public void run() {
                int gid = getGlobalId();
                int value = V[gid];
                for(int index = 0; index < count; index++) {
                    if (value == index)
                        kernelTotals[index][gid] = 1;
                }
            }
        };
        mapKernel.execute(Range.create(size));
        mapKernel.dispose();
        totals = kernelTotals;

        //////////////////
        // REDUCE PHASE //
        //////////////////
        while (size > 1) {
            int nextSize = size / 2;
            final int[][] currentTotals  = totals;
            final int[][] nextTotals = new int[count][nextSize];
            Kernel reduceKernel = new Kernel() {
                @Override
                public void run() {
                    int gid = getGlobalId();
                    for(int index = 0; index < count; index++) {
                        nextTotals[index][gid] = currentTotals[index][gid * 2] + currentTotals[index][gid * 2 + 1];
                    }
                }
            };
            reduceKernel.execute(Range.create(nextSize));
            reduceKernel.dispose();

            totals = nextTotals;
            size = nextSize;
        }
        assert size == 1;

        /////////////////////////////
        // Done, just print it out //
        /////////////////////////////
        int[] results = new int[3];
        results[0] = totals[0][0];
        results[1] = totals[1][0];
        results[2] = totals[2][0];

        System.out.println(Arrays.toString(results));
    }
}