A Client reading text from 2 servers in parallel. How to implement?

Question

Hi guys,
Quite new here I am,
I want to implement the scenario where a client reads data (Line) from 2 servers at the same time in parallel. I have been looking at examples over the net but nearly all the cases refer to multiple clients and a single server. The client after receiving the lines which consists of strings in parallel from servers, it will sort the words and display the 20 words with most occurrences. I'm new to threading so any help is definetely appreciated. I have a deadline until tonight. Thanks for your help.

Answer 1

Would the below do the trick guys?
import java.io.*;
import java.net.*;
import java.util.*;
public class SimpleClient {
     HashMap<String, Integer> wordCount = new HashMap<String, Integer>();
     BufferedReader reader1,reader2;
     PrintWriter writer1,writer2;
     Socket sock1,sock2;
     public static void main (String[] args) {
          SimpleClient client = new SimpleClient();
          client.go();
     public void go(){
          try {
               sock1 = new Socket("127.0.0.1",6361);
               sock2 = new Socket("127.0.0.1",6362);
               InputStreamReader streamReader1 = new InputStreamReader(sock1.getInputStream());
               reader1 = new BufferedReader(streamReader1);
               writer1 = new PrintWriter(sock1.getOutputStream());
               InputStreamReader streamReader2 = new InputStreamReader(sock2.getInputStream());
               reader2 = new BufferedReader(streamReader2);
               writer2 = new PrintWriter(sock2.getOutputStream());
               Thread readerThread1 = new Thread(new IncomingReader1());
               Thread readerThread2 = new Thread(new IncomingReader2());
               readerThread1.start();
               readerThread2.start();
               displayResults();
          catch(IOException ex){
               ex.printStackTrace();
     public void displayResults(){
          //Time to create a List to be able to sort by frequency (occurrence)..Collections becomes handy in this case
          //We could have used TreeMap if we had been asked to sort using key instead of value(occurrence).
          try{
             List<Map.Entry> list = new ArrayList<Map.Entry>(wordCount.entrySet());     
             Collections.sort(list, new Comparator<Map.Entry>() {     
                 public int compare(Map.Entry e1, Map.Entry e2) {     
                     Integer i1 = (Integer) e1.getValue();     
                     Integer i2 = (Integer) e2.getValue();     
                     return i2.compareTo(i1);
             System.out.println("letter - freq");
             System.out.println("-------------");
             for(Map.Entry e : list) {
                  System.out.printf("  %-8s%d%n", e.getKey(), e.getValue());
          }catch (Exception ex){
               ex.printStackTrace();
     //Synchronized so we avoid
     public synchronized void placeInHashMap(String token){
          if (wordCount.containsKey(token)){
               wordCount.put(token, wordCount.get(token) + 1);
          else{
               wordCount.put(token,1);
     public class IncomingReader1 implements Runnable{
          public void run() {
               String lineReceived = null;
               try{
                    while((lineReceived = reader1.readLine()) != null){
                         System.out.println("Server 1:" + lineReceived);
                         String[] result = lineReceived.split(" ");
                         for (String token:result){
                              placeInHashMap(token);}
               }catch(Exception ex){
                    ex.printStackTrace();
     public class IncomingReader2 implements Runnable{
          public void run() {
               String lineReceived = null;
               try{
                    while((lineReceived = reader2.readLine()) != null){
                         System.out.println("Server 2:" + lineReceived);
                         String[] result = lineReceived.split(" ");
                         for (String token:result){
                              placeInHashMap(token);}
               }catch(Exception ex){
                    ex.printStackTrace();
}//Class end!