include ../benchmarks.mk
BENCH := hashmap
-NORMAL_TESTS := testcase1 testcase2 testcase3
+NORMAL_TESTS := testcase1 testcase2
WILDCARD_TESTS := $(patsubst %, %_wildcard, $(NORMAL_TESTS))
When b and d both read the old head of the list (and they later grab the lock,
making it the interface SC), it's non-SC because neither reads the updated
value.
+
+Run testcase1 to make the store and load of value slot to be seq_cst.
+
+Then run testcase2 with "-o annotation" to get store and load of key slot to be
+release/acquire.
+
+0m0.015s + 0m0.000 = 0m0.015s
+peizhaoo@dw-2:~/test/model-checker-priv/model-checker-priv$ time ./run.sh
+benchmarks/concurrent-hashmap/testcase1_wildcard -m2 -y -u3 -tSCFENCE -o weaken
+&> /scratch/a
+
+real 0m0.031s
+user 0m0.015s
+sys 0m0.000s
+
Result 0:
wildcard 1 -> memory_order_relaxed
wildcard 2 -> memory_order_relaxed
-wildcard 3 -> memory_order_acquire
-wildcard 4 -> memory_order_relaxed
-wildcard 6 -> memory_order_relaxed
-wildcard 7 -> memory_order_relaxed
+wildcard 3 -> memory_order_relaxed
+wildcard 4 -> memory_order_seq_cst
wildcard 9 -> memory_order_relaxed
-wildcard 13 -> memory_order_release
+wildcard 10 -> memory_order_relaxed
+wildcard 11 -> memory_order_seq_cst
+wildcard 13 -> memory_order_relaxed
+peizhaoo@dw-2:~/test/model-checker-priv/model-checker-priv$ time ./run.sh
+benchmarks/concurrent-hashmap/testcase2_wildcard -m2 -y -u3 -tSCFENCE -o weaken
+-o fbenchmarks/concurrent-hashmap/result1.txt -o annotation &> /scratch/a
+
+real 0m0.027s
+user 0m0.000s
+sys 0m0.014s
+
Result 0:
wildcard 1 -> memory_order_relaxed
wildcard 2 -> memory_order_relaxed
wildcard 3 -> memory_order_acquire
wildcard 4 -> memory_order_seq_cst
+wildcard 5 -> memory_order_relaxed
wildcard 6 -> memory_order_relaxed
-wildcard 7 -> memory_order_relaxed
+wildcard 8 -> memory_order_relaxed
wildcard 9 -> memory_order_relaxed
wildcard 10 -> memory_order_relaxed
wildcard 11 -> memory_order_seq_cst
+wildcard 12 -> memory_order_relaxed
wildcard 13 -> memory_order_release
// Key(3, 4, 5) & Key(1, 4, 3) are hashed to the same slot -> 5
+/** Making w4 & w11 seq_cst */
+
void threadA(void *arg) {
Key *k1 = new Key(3, 2, 6);
Key *k2 = new Key(1, 1, 1);
}
int user_main(int argc, char *argv[]) {
+
+ Key *k1 = new Key(3, 2, 6);
+ Key *k2 = new Key(1, 1, 1);
+ Value *v1 = new Value(111, 111, 111);
+ Value *v2 = new Value(222, 222, 222);
thrd_t t1, t2;
table = new HashMap;
+ table->put(k1, v1);
+ table->put(k2, v2);
thrd_create(&t1, threadA, NULL);
thrd_create(&t2, threadB, NULL);
// Key(3, 2, 6) & Key(1, 3, 3) are hashed to the same slot -> 4
// Key(1, 1, 1) & Key(3, 2, 2) are hashed to the same slot -> 0
// Key(2, 4, 1) & Key(3, 4, 2) are hashed to the same slot -> 3
-// Key(3, 4, 5) & Key(1, 4, 3) are hashed to the same slot -> 5
-
+// Key(3, 4, 5) & Key(1, 4, 3) & Key(1, 1, 6) are hashed to the same slot -> 5
+// Key(2, 4, 8) & Key(1, 3, 8) -> 9
+// Key(1, 4, 8) -> 10
+// Key(1, 3, 7) -> 8
+// Key(1, 2, 7) -> 7
+// Key(1, 2, 6) -> 6
void threadA(void *arg) {
Key *k1 = new Key(3, 2, 6);
- Key *k2 = new Key(1, 1, 1);
- Value *v1 = new Value(10, 10, 10);
- Value *r1 = table->put(k1, v1);
+ Key *k2 = new Key(1, 3, 3);
+ Key *k3 = new Key(2, 4, 1);
+ Key *k4 = new Key(3, 4, 2);
+ Value *v2 = new Value(10, 10, 10);
+ Value *r1 = table->put(k2, v2);
//printValue(r1);
- Value *r2 = table->get(k2);
- //printf("Thrd A:\n");
- printValue(r2);
+ Value *r2 = table->get(k4);
+ //printValue(r2);
}
void threadB(void *arg) {
Key *k1 = new Key(3, 2, 6);
- Key *k2 = new Key(1, 1, 1);
- Value *v2 = new Value(30, 40, 50);
- Value *r3 = table->put(k2, v2);
- //printValue(r3);
- Value *r4 = table->get(k1);
- printf("Thrd B:\n");
- printValue(r4);
+ Key *k2 = new Key(1, 3, 3);
+ Key *k3 = new Key(2, 4, 1);
+ Key *k4 = new Key(3, 4, 2);
+ Value *v3 = new Value(30, 40, 50);
+ Value *r3 = table->put(k3, v3);
}
int user_main(int argc, char *argv[]) {
-
Key *k1 = new Key(3, 2, 6);
- Key *k2 = new Key(1, 1, 1);
+ Key *k2 = new Key(1, 3, 3);
+ Key *k3 = new Key(2, 4, 1);
+ Key *k4 = new Key(3, 4, 2);
Value *v1 = new Value(111, 111, 111);
Value *v2 = new Value(222, 222, 222);
thrd_t t1, t2;
table = new HashMap;
table->put(k1, v1);
- table->put(k2, v2);
+ //table->put(k3, v2);
thrd_create(&t1, threadA, NULL);
thrd_create(&t2, threadB, NULL);
+++ /dev/null
-#include <threads.h>
-
-#ifdef WILDCARD
-#include "hashmap_wildcard.h"
-#else
-#include "hashmap.h"
-#endif
-
-HashMap *table;
-
-void printKey(Key *key) {
- if (key)
- printf("pos = (%d, %d, %d)\n", key->x, key->y, key->z);
- else
- printf("pos = NULL\n");
-}
-
-void printValue(Value *value) {
- if (value)
- printf("velocity = (%d, %d, %d)\n", value->vX, value->vY, value->vZ);
- else
- printf("velocity = NULL\n");
-}
-
-// Key(3, 2, 6) & Key(1, 3, 3) are hashed to the same slot -> 4
-// Key(1, 1, 1) & Key(3, 2, 2) are hashed to the same slot -> 0
-// Key(2, 4, 1) & Key(3, 4, 2) are hashed to the same slot -> 3
-// Key(3, 4, 5) & Key(1, 4, 3) & Key(1, 1, 6) are hashed to the same slot -> 5
-// Key(2, 4, 8) & Key(1, 3, 8) -> 9
-// Key(1, 4, 8) -> 10
-// Key(1, 3, 7) -> 8
-// Key(1, 2, 7) -> 7
-// Key(1, 2, 6) -> 6
-
-void threadA(void *arg) {
- Key *k1 = new Key(3, 4, 5);
- Key *k2 = new Key(1, 4, 3);
- Key *k3 = new Key(1, 1, 6);
- Value *v2 = new Value(10, 10, 10);
- Value *r1 = table->put(k2, v2);
- //printValue(r1);
- Value *r2 = table->get(k3);
- printf("k1 -> %d:\n", table->hashKey(k1) % table->capacity);
- printf("k2 -> %d:\n", table->hashKey(k2) % table->capacity);
- printf("k3 -> %d:\n", table->hashKey(k3) % table->capacity);
- //printValue(r2);
-}
-
-void threadB(void *arg) {
- Key *k1 = new Key(3, 4, 5);
- Key *k2 = new Key(1, 4, 3);
- Key *k3 = new Key(1, 1, 6);
- Value *v3 = new Value(30, 40, 50);
- Value *r3 = table->put(k3, v3);
- //printValue(r3);
- //Value *r4 = table->get(k1);
- //printf("Thrd B:\n");
- //printValue(r4);
-}
-
-int user_main(int argc, char *argv[]) {
- Key *k1 = new Key(3, 4, 5);
- Key *k2 = new Key(1, 4, 3);
- Key *k3 = new Key(1, 1, 6);
- //Key *k2 = new Key(1, 3, 3);
- Value *v1 = new Value(111, 111, 111);
- //Value *v2 = new Value(222, 222, 222);
- thrd_t t1, t2;
- table = new HashMap;
- table->put(k1, v1);
- //table->put(k2, v2);
-
- thrd_create(&t1, threadA, NULL);
- thrd_create(&t2, threadB, NULL);
- thrd_join(t1);
- thrd_join(t2);
-
- return 0;
-}
-
-
projects / model-checker-benchmarks.git / commitdiff