aboutsummaryrefslogtreecommitdiffstats
path: root/test/ccured_olden/bisort/README
diff options
context:
space:
mode:
Diffstat (limited to 'test/ccured_olden/bisort/README')
-rw-r--r--test/ccured_olden/bisort/README22
1 files changed, 22 insertions, 0 deletions
diff --git a/test/ccured_olden/bisort/README b/test/ccured_olden/bisort/README
new file mode 100644
index 00000000..7b12c4bb
--- /dev/null
+++ b/test/ccured_olden/bisort/README
@@ -0,0 +1,22 @@
+/* For copyright information, see olden_v1.0/COPYRIGHT */
+******************
+olden_v1.0/benchmarks/bisort/README
+January 3, 1995
+Martin C. Carlisle
+
+this directory contains the Bitonic Sort benchmark:
+G. Bilardi and A. Nicolau. "Adaptive Bitonic Sorting: An optimal
+parallel algorithm for shared-memory machines." SIAM J. Comput.
+18(2):216-228, 1989.
+
+as implemented for Olden by Martin C. Carlisle
+******************
+
+Makefile - "make bisort" makes executable
+
+args.c - handle command line arguments
+bitonic.c - main routines
+swap.c - used to swap subtrees
+node.h - declarations
+code.h - prototypes
+