/* * Copyright (c) 2015 * The President and Fellows of Harvard College. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /* * bigfork - concurrent VM test that behaves somewhat better than * parallelvm. * * This test is a mixture of forktest and parallelvm: it does nested * forks like forktest, and aimless matrix operations like parallelvm; * the goal is to serve as a performance benchmark more than as a * stress test (though it can be that too) and in particular to * exhibit less timing variance than parallelvm does. The variance is * still fairly high, but the variance of parallelvm is horrific. */ #include #include #include #include #include #define BRANCHES 6 /* * 6 branches gives 64 procs at the final stage, and we want this to * use about 4M. So each proc's memory load should be about 1/16M or * 64K. Which is 16384 ints, or four 64x64 matrixes. */ #define DIM 64 static int m1[DIM*DIM], m2[DIM*DIM], m3[DIM*DIM], m4[DIM*DIM]; static const int right[BRANCHES] = { 536763422, 478946723, 375722852, 369910585, 328220902, 62977821, }; static unsigned failures; static void init(void) { unsigned i, j; srandom(73771); for (i=0; i 0) { failures += WEXITSTATUS(status); } } } static void dotest(void) { unsigned i, me; pid_t pids[BRANCHES]; int t; char msg[128]; me = 0; for (i=0; i 0; ) { dowait(pids[i]); } if (failures > 0) { printf("%u failures.\n", failures); } else { printf("Done.\n"); } } int main(void) { init(); dotest(); return 0; }