Changeset 13972 for branches/thasling/DistributedGA/DistributedGA.Core/Implementation

Timestamp:

07/01/16 20:24:52 (8 years ago)

Author:

thasling

Message:

#2615:
improved log
made changes in data structure

Location:

branches/thasling/DistributedGA/DistributedGA.Core/Implementation

Files:

• PeerNetworkMessageHandler.cs (modified) (6 diffs)
• WcfMessageSender.cs (modified) (6 diffs)

branches/thasling/DistributedGA/DistributedGA.Core/Implementation/PeerNetworkMessageHandler.cs

@@ -22 +22 @@
     //two queues are used to gather and and provide population more efficiently
     private object activeQueueLocker = new Object();
-    private SizedConcurrentQueue<byte[]> writeQueue;
-    private SizedConcurrentQueue<byte[]> readQueue;
+    private SizedConcurrentQueue<KeyValuePair<PeerInfo,byte[]>> writeQueue;
+    private SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>> readQueue;
 
     //uses IMessageService for recieving population from one peer at once
@@ -38 +38 @@
         }; // TODO: get own peerinfo
 
-        writeQueue = new SizedConcurrentQueue<byte[]>();
-        readQueue = new SizedConcurrentQueue<byte[]>();
+        writeQueue = new SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>>();
+        readQueue = new SizedConcurrentQueue<KeyValuePair<PeerInfo,byte[]>>();
         writeQueue.Limit = messageCacheCapacity;
         readQueue.Limit = writeQueue.Limit;
@@ -70 +70 @@
     }
 
-    public void PublishDataToNetwork(byte[][] data) {
+    public void PublishDataToNetwork(byte[] data) {
       try {
         foreach (PeerInfo peer in peerListManager.GetPeerList()) {
@@ -87 +87 @@
     }
 
-    public byte[][] GetDataFromNetwork() {
+    public List<KeyValuePair<PeerInfo, byte[]>> GetDataFromNetwork() {
       try {
-        List<byte[]> res = new List<byte[]>();
-        byte[] item = null;
+        List<KeyValuePair<PeerInfo, byte[]>> res = new List<KeyValuePair<PeerInfo, byte[]>>();
+        KeyValuePair<PeerInfo,byte[]> item;
         lock (activeQueueLocker) {
           //changing the current queue for storing items to send
@@ -105 +105 @@
           }
         }
-        return res.ToArray();
+        return res;//.ToArray();
       }
       catch (Exception ex) {
@@ -146 +146 @@
       if (e != null && e.Sender.ProblemInstance.Equals(ownInstance.ProblemInstance)) {
         lock (activeQueueLocker) {
-            writeQueue.Enqueue(e.data);
+            writeQueue.Enqueue(new KeyValuePair<PeerInfo, byte[]>(e.Sender, e.data));
         }
 

branches/thasling/DistributedGA/DistributedGA.Core/Implementation/WcfMessageSender.cs

@@ -15 +15 @@
 
     //providing two queues for faster access
-    private SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[][]>> bufferedMessagesWrite;
-    private SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[][]>> bufferedMessagesRead;
+    private SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>> bufferedMessagesWrite;
+    private SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>> bufferedMessagesRead;
 
 
@@ -25 +25 @@
     public void Init(PeerInfo source, int messageCacheCapacity) {
       myself = source;
-      bufferedMessagesRead = new SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[][]>>();
+      bufferedMessagesRead = new SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>>();
       bufferedMessagesRead.Limit = messageCacheCapacity;
-      bufferedMessagesWrite = new SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[][]>>();
+      bufferedMessagesWrite = new SizedConcurrentQueue<KeyValuePair<PeerInfo, byte[]>>();
       bufferedMessagesWrite.Limit = bufferedMessagesRead.Limit;
       timer = new Timer(1000 * 10); //each 10 seconds
@@ -34 +34 @@
     }
 
-    public void SendData(PeerInfo destination, byte[][] data) {
-      bufferedMessagesWrite.Enqueue(new KeyValuePair<PeerInfo, byte[][]>(destination, data));
+    public void SendData(PeerInfo destination, byte[] data) {
+      bufferedMessagesWrite.Enqueue(new KeyValuePair<PeerInfo, byte[]>(destination, data));
     }
 
@@ -50 +50 @@
         bufferedMessagesRead = bufferedMessagesWrite;
         bufferedMessagesWrite = tmp;
-        List<KeyValuePair<PeerInfo, byte[][]>> messages = new List<KeyValuePair<PeerInfo, byte[][]>>();
+        List<KeyValuePair<PeerInfo, byte[]>> messages = new List<KeyValuePair<PeerInfo, byte[]>>();
         while (!bufferedMessagesRead.IsEmpty) {
-          KeyValuePair<PeerInfo, byte[][]> message;
+          KeyValuePair<PeerInfo, byte[]> message;
           if (bufferedMessagesRead.TryDequeue(out message)) {
             messages.Add(message);
@@ -72 +72 @@
     /// <param name="messages">a list with multiple messages to the same  destination</param>
     /// <returns></returns>
-    private List<KeyValuePair<PeerInfo, byte[][]>> MergeMessages(List<KeyValuePair<PeerInfo, byte[][]>> messages) {
+    private List<KeyValuePair<PeerInfo, byte[][]>> MergeMessages(List<KeyValuePair<PeerInfo, byte[]>> messages) {
       List<KeyValuePair<PeerInfo, byte[][]>> res = new List<KeyValuePair<PeerInfo, byte[][]>>();
       Dictionary<PeerInfo, List<byte[]>> cache = new Dictionary<PeerInfo, List<byte[]>>();
@@ -79 +79 @@
           cache.Add(messagePackage.Key, new List<byte[]>());
         }
-        for (int i = 0; i <= messagePackage.Value.GetUpperBound(0); i++) {
-          cache[messagePackage.Key].Add(messagePackage.Value[i]);
-        }
+        //for (int i = 0; i <= messagePackage.Value.GetUpperBound(0); i++) {
+          cache[messagePackage.Key].Add(messagePackage.Value);
+        //}
       }
       //now we have a dictionary with all messages per destionation