Lines Matching +full:parallel +full:- +full:in

7 # Redistribution and use in source and binary forms, with or without
12 # 2. Redistributions in binary form must reproduce the above copyright
13 # notice, this list of conditions and the following disclaimer in the
19 # ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 # HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 # LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 # "panic: ASan: Invalid access, 8-byte read at ..., MallocRedZone(fb)" seen
36 [ `sysctl vm.swap_total | sed 's/.* //'` -eq 0 ] && exit 0
45 mycc -o radix -Wall -Wextra radix.c || exit 1
46 rm -f radix.c
49 set -u
50 trap "rm -f rendezvous" EXIT INT
51 parallel=1
56 timeout 20m /tmp/radix $parallel > $log; s=$?
57 [ $s -eq 124 ] && { echo "Timed out"; break; }
58 [ $s -ne 0 ] && cat $log
60 [ -z "$used" ] && break
61 [ $((`date +%s` - start)) -gt 300 ] && break
62 [ $used -gt $((usermem / pagesize)) ] && break
63 [ $parallel -eq 1 ] &&
64 parallel=$((usermem / pagesize / used))
65 parallel=$((parallel + 1))
66 [ $parallel -gt 10 ] && parallel=10
70 rm -f /tmp/radix $log
75 On Wed, 17 Apr 2013 18:57:00 -0500 alc wrote:
80 4104, 4105, ... in each of the VM objects. (The sequence would be
81 different on amd64.) I could work around the 32-bit address space
83 Each of the VM objects would have only one less interior node in the
115 static int parallel;
142 for (i--; i >= 0; i--)
143 state[i]--;
187 if ((f = popen("vmstat -z | grep RADIX | awk -F',' '{print $3}'", "r")) == NULL)
209 if ((fd = open("/dev/zero", O_RDWR)) == -1)
238 errx(1, "Usage: %s <number of parallel processes>.", argv[0]);
239 parallel = atoi(argv[1]);
245 pids = malloc(parallel * sizeof(pid_t));
246 if (pipe(fds) == -1)
249 for (i = 0; i < parallel; i++) {
253 if ((rfd = open("rendezvous", O_CREAT, 0644)) == -1)
257 while (s1 != parallel) {
262 for (i = 0; i < parallel; i++) {
269 " RADIX nodes used, p/r = %.1f, parallel = %d.\n",
270 pages, pages * ps / 1024. / 1024, r2 - r1,
271 pages / (r2 - r1 + 0.), parallel);
273 for (i = 0; i < parallel; i++) {