7c4a484989
[commtech] Simplify if's in send()
...
Test sender_ptr against the end of the current buffer via
channel->sender_ptr_end
2012-01-30 20:14:22 +01:00
a20c9a8a21
[commtech] BatchQueue v2
...
Uses 2 mapping to the same structure to avoid prefetching of the
producer semi-buffer by the consumer. The idea is to access everything
through mapping 1 except semi-buffer 2 which is accessed through mapping
2.
2012-01-30 20:09:52 +01:00
Thomas Preud'homme
c6786815cd
Add native algo from OpenMP stream extension
...
Add native algorithm from OpenMP stream extension. This require adding
one function in commtech.h: end_producer(). This function does nothing
for all communication algorithm but gomp_stream (the algorithm added by
this commit).
2012-01-30 20:07:11 +01:00
a30a5bfe06
Make all threads are joined
...
in join_threads, nb_thread is the id of the last thread, not the number
of threads to join. Hence the for loop must include this id.
2011-06-01 15:35:08 +02:00
f0c75c7570
SINK thread (not INTERM) notify its termination
...
Use !!node_param->type & SINK in likely macro to test wether we are a
SINK node or an INTERM node.
2011-06-01 15:25:08 +02:00
bd7379e73a
Propose 2048 and 4096 buffer size for BatchQueue.
2011-05-27 15:42:40 +02:00
f05cfdcd92
Improve pipeline (cons and prod in //)
2011-05-25 14:33:42 +02:00
f01db158c2
Use multiples of BUF_SIZE when needed
...
Number of cache line sent and size of reception buffer must be a
multiple of BUF_SIZE.
2011-05-10 11:14:28 +02:00
6fcfd60d2d
Fix buffer loop in BatchQueue single data mode
...
The buffer in single data mode in batchQueue was not circular because a
variable was not renamed
2011-05-10 11:02:00 +02:00
70f8f95647
Fix option to choose the number of node
...
Option is now in the getopt string and accessible with -l switch.
2011-05-10 11:00:59 +02:00
f430cc17a7
Fix bugs coming from refactoring
2011-05-05 19:54:44 +02:00
372c36155a
Fix incorrect usage string: --check -> -k
2011-05-05 14:52:41 +02:00
756a701466
[commtech] Refactor to chain more than 2 nodes
...
* Refactor the source to be able to chain more than 2 nodes together
* Compile all binaries by default (binList must be set manually in
lancement.sh to run only a subset of the binaries
2011-05-05 14:34:09 +02:00
5d71bc53f1
[commtech] Varying size of buffer for BatchQueue
...
Create several variation of BatchQueue, each with a different buffer
size: batch_queue_1024, batch_queue_512, ..., batch_queue_2.
2011-05-05 11:30:00 +02:00
9c835d4c46
Add a "sent words == received words" check
2011-05-04 19:35:10 +02:00
22c97ab418
[commtech] Make BUF_SIZE definition be per tech
...
Don't define BUF_SIZE globally anymore, but per communication technique
2011-03-02 13:19:22 +01:00
7c515200e7
[commtech] Remove asm_cache from the comm techs
2011-03-02 13:19:22 +01:00
90b7a8007b
[commtech] Rename c_cache to batch_queue
2011-03-02 13:19:22 +01:00
7d7ad0c46a
[commtech] Make WORDS_PER_BUF indep of BUF_SIZE.
...
The number of data sent must be independent of the buffer size chosen
by each algorithm.
2011-01-28 04:56:44 +01:00
c3aad28ad5
[commtech] Add calculation method
...
Add a calculation method which add the value of the first integer of
n consecutive cache lines and write the results in one of the integer of
these cache lines. Next calculation uses the next n consecutives cache
lines and write the result in the next integer.
2011-01-25 17:24:53 +01:00
975411a824
Split CSQ in 2 communication techniques.
...
* Divide CSQ in 2 communication techniques: one with 2 slots (as in
BatchQueue aka c_cache) and one with 64 slots (as in the article)
* Rename fake communication technique in none communication technique
and disable any activity (send no longer does anything)
2011-01-25 17:24:53 +01:00
5eb7fb50c7
[commtech] CSQ use memcpy in dequeue for fairness
...
Paper about CSQ uses memcpy in enqueue and dequeue. Although it is not
possible to use memcpy in enqueue because of current API, it is possible
to use memcpy in dequeue, hence this commit.
2011-01-19 12:37:14 +01:00
35a81bb736
[commtech] Place volatile on the right qualifier.
2011-01-13 14:58:13 +01:00
2d879dc3fc
[commtech] Fix idx test in c_cache technique.
...
c_cache watching status value when idx % BUF_SIZE != 0 instead of when
it's equal zero.
2011-01-03 11:35:42 +01:00
6c2868e20c
[commtech bench] Take the mean over 10 run.
2010-10-13 23:57:58 +02:00
006b1b1d94
Simplify and rewrite comm API.
2010-10-01 18:57:46 +02:00
Thomas Preud'homme
5e3a7f6ce0
commtechs: BUGFIX wait threads to be initialized
2009-07-07 16:08:00 +02:00
Thomas Preud'homme
c99d8be100
commtechs: BUGFIX deadlock in thread init
2009-07-07 15:56:20 +02:00
Thomas Preud'homme
698341b99e
commtech: Update usage help
2009-07-01 03:10:38 +02:00
Thomas Preud'homme
415004fb4b
commtech: Update usage help
2009-07-01 02:45:28 +02:00
Thomas Preud'homme
3341546c75
commtech: calc lib take 1 argument on command line
2009-07-01 02:36:11 +02:00
Thomas Preud'homme
7a1610961c
commtech: BUGFIX unwanted optimization
...
Replace prod += 42 by prod += fourty_two where fourty_two is a volatile
variable to avoid replacement of the loop into a prod += 42 * nb_loop
2009-07-01 02:34:50 +02:00
Thomas Preud'homme
243d8810f1
commtech: avoid a double free corruption
...
Remove srand and rand function call as they generates double free
corruption (???)
2009-07-01 01:49:16 +02:00
Thomas Preud'homme
e90348b54c
commtech: BUFFIX in freeing pages
...
Don't try to free the middle of an allocation
2009-07-01 01:48:13 +02:00
Thomas Preud'homme
ba13c18af7
commtech: Free pages when jikes barrier ends
2009-07-01 00:45:19 +02:00
Thomas Preud'homme
e04818645a
commtech: Add a new calculation method
...
This calculation performs only a loop and avoid cache pollution
2009-06-30 22:37:55 +02:00
Thomas Preud'homme
c98db4b4ba
commtech: do_calc() return a void **
...
This respect what we claim to send to the send() function and allow to
reduce the FAKE_NURSERY_START. Thus we are sure gcc won't optimize the
second part of the if in include/jikes_barrier_comm.h
2009-06-30 22:35:11 +02:00
Thomas Preud'homme
7bfc46db78
commtech: Delete pages free
...
Pages cannots be freed as fast as they are allocated, so this whole
mecanism can only delay the kernel panic. It's wiser to exit badly if
too much memory is consumed
2009-06-30 22:32:59 +02:00
Thomas Preud'homme
6b9777cb9b
Align shared_mem and initial jikes buffer
2009-06-25 14:01:18 +02:00
Thomas Preud'homme
c9323cd901
BUGFIX: Fix a possible deadlock if an error occurs
2009-06-25 13:47:50 +02:00
Thomas Preud'homme
177e548efe
commtechs benchs: fake_comm perform the writes
2009-06-24 23:35:58 +02:00
Thomas Preud'homme
2fe89da8a2
free memory after 100 Mo allocated
2009-06-24 23:26:51 +02:00
Thomas Preud'homme
8f0aecedec
comtechs bench: Better management of errors
2009-06-24 22:25:28 +02:00
Thomas Preud'homme
e9dc20ecd8
commtechs bench: time per loop + time per write
2009-06-24 18:18:05 +02:00
Thomas Preud'homme
34faada5fe
commtechs: Correctly parse outputs
2009-06-24 00:53:13 +02:00
Thomas Preud'homme
bc3c66027b
Display total time
2009-06-23 13:10:04 +02:00
Thomas Preud'homme
e39c05664a
comm lib have their own directory as calc libs
2009-06-23 12:30:49 +02:00
Thomas Preud'homme
a590ecca09
commtechs bench: calculation init takes an arg
2009-06-19 21:15:23 +02:00
Thomas Preud'homme
f4b3904541
commtechs bench: add calc_mat calculation lib
...
* Add a matrice calculation as one of the possible calculation
* Modify the makefile to permit calculation lib compilation
* Reorganize the makefile to be able to execute the default target
2009-06-19 20:53:34 +02:00
Thomas Preud'homme
f9128c0348
commtechs bench: Addresses are calculated
2009-06-19 13:27:08 +02:00
Thomas Preud'homme
Thomas Preud'homme