Added src/sorting/scaling.py to test sort algorithm scaling vs. N.

[parallel_computing.git] / src / sorting / Makefile

diff --git a/src/sorting/Makefile b/src/sorting/Makefile
index 4d84d0f25ac5ec13906b4971ced4ad7865ea01c9..d41127f9b62016e67dfdaf71b6ad2aa888cd875b 100644 (file)
--- a/src/sorting/Makefile
+++ b/src/sorting/Makefile
@@ -14,13 +14,18 @@ EXECS         = bubble quicksort
 
 # Top level targets
 
-all: $(EXECS) $(DATA)
+all : $(EXECS) $(DATA)
 
-clean:
-       $(RM) -f *.o $(EXECS) $(DATA)
+clean :
+       $(RM) -f *.o $(EXECS) $(EXECS:%=%-scaling.*) $(DATA)
+
+scaling : $(EXECS:%=%-scaling.dat)
 
 # Lower level rules
 
+%-scaling.dat : % scaling.py data.py
+       ./scaling.py --max-time 1 --repeats 3 --plot $(@:%.dat=%.png) ./$< > $@
+
 data : data.py
        ./$< $(DATA_SIZE) > $@