Changeset e2f827f

Timestamp:

Mar 30, 2023, 4:01:44 PM (16 months ago)

Author:

caparson <caparson@…>

Branches:

ADT, ast-experimental, master

Children:

d24b1985

Parents:

76a8400

Message:

added go counterpart to cfa benchmarks

Location:

doc/theses/colby_parsons_MMAth/benchmarks/channels/go

Files:

• barrier/barrier.go (added)
• barrier/go.mod (added)
• churn/churn.go (added)
• churn/go.mod (added)
• contend/contend.go (moved) (moved from doc/theses/colby_parsons_MMAth/benchmarks/channels/go/contend.go) (3 diffs)
• contend/go.mod (added)
• daisy_chain/daisy_chain.go (added)
• daisy_chain/go.mod (added)
• hot_potato/go.mod (added)
• hot_potato/hot_potato.go (added)
• ping_pong/go.mod (added)
• ping_pong/ping_pong.go (added)
• pub_sub/go.mod (added)
• pub_sub/pub_sub.go (added)

doc/theses/colby_parsons_MMAth/benchmarks/channels/go/contend/contend.go

@@ -64 +64 @@
                 case 3:
                         if os.Args[2] != "d" {                                                  // default ?
-                                ChannelSize, _ = strconv.Atoi( os.Args[1] )
+                                ChannelSize, _ = strconv.Atoi( os.Args[2] )
                                         if ChannelSize < 0 { usage(); }
                         } // if
@@ -78 +78 @@
         } // switch
         runtime.GOMAXPROCS( Processors );
-        ProdsPerChan = Processors
-        ConsPerChan = Processors
+        ProdsPerChan = Processors /2
+        ConsPerChan = Processors / 2
 
         // fmt.Println("Processors: ",Processors," Channels: ",Channels," ProdsPerChan: ",ProdsPerChan," ConsPerChan: ",ConsPerChan," Channel Size: ",ChannelSize)
@@ -108 +108 @@
         cons_done = true
         for i := range chans {
-                J: for j := 0; j < ConsPerChan; j++ {
+                L: for {
                         select {
-                                case chans[i] <- 0:
-                                        
+                                case k := <-chans[i]:
+                                        cons_check = cons_check ^ k
                                 default:
-                                        break J
+                                        break L
                         }
                 }
         }
+        for i := range chans {
+                close(chans[i])
+        }
+
         for j := 0; j < ConsPerChan * Channels; j++{
                 <-consJoin
         }
         
-        // for i := range chans {
-        //      L: for {
-        //              select {
-        //                      case k := <-chans[i]:
-        //                              cons_check = cons_check ^ k
-        //                      default:
-        //                              break L
-        //              }
-        //      }
-        // }
+        
         if cons_check != prod_check {
                 fmt.Println("\nChecksum mismatch: Cons: %d, Prods: %d", cons_check, prod_check)
         }
-        for i := range chans {
-                close(chans[i])
-        }
     fmt.Println(total_operations)
 }