今天看啥  ›  专栏  ›  北1111

分布式计算第二次作业

北1111  · CSDN  ·  · 2020-03-13 16:15

题目

实现一个支持并发服务的 网络 运算 服务器程序。该服务器能够同时接收来自于多个客户端的运算请求,然后根据运算类型和请求参数完成实际的运算,最后把运算结果返回给客户端。

客户端


import java.io.IOException;
import java.net.*;


public class Client  {

    private DatagramSocket datagramSocket;
    private InetAddress address ;
    private int port;

    public Client(){
        this(18888,"127.0.0.1");
    }
    public Client(int port, String netAddress){
        try {
            this.port=port;
            datagramSocket = new DatagramSocket(); //发送端口可以不指定
            address=InetAddress.getByName(netAddress);

        } catch (SocketException e) {
            e.printStackTrace();
        } catch (UnknownHostException e) {
            e.printStackTrace();
        }
    }


    public void send(String requestParam) {
        try {
            DatagramPacket datagramPacket = new DatagramPacket(requestParam.getBytes(), requestParam.length(),address,port);
            datagramSocket.send(datagramPacket);

            String[] str =requestParam.split("\n");
            System.out.print("send: ");
            for(String s:str){
                System.out.print(s+" ");
            }
            System.out.println();

            byte[] receiveBuff = new byte[1024];
            DatagramPacket receivePaket = new DatagramPacket(receiveBuff,receiveBuff.length);
            datagramSocket.receive(receivePaket);
            String receiveParam = new String(receivePaket.getData(),0,receivePaket.getLength());
            System.err.println("receive :"+receiveParam);
            System.out.println();

        } catch (SocketException | UnknownHostException e) {
            e.printStackTrace();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    public static void main(String[] args) {
        Client client = new Client();

        Runnable runnable = new Runnable() {
            @Override
            public void run() {
                for (int i = 3; i < 5; ++i) {
                    for (int j = 3; j < 5; ++j) {
                        StringBuilder sb = new StringBuilder();
                        sb.append("x\n");
                        sb.append(i);
                        sb.append("\n");
                        sb.append(j);
                        sb.append("\n");
                        client.send(sb.toString());
                    }
                }
            }
        };

        for(int i=0;i<3;++i){
            new Thread(runnable).start();
        }


    }
}
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82

服务端


import java.io.IOException;
import java.net.DatagramPacket;
import java.net.DatagramSocket;
import java.net.SocketException;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.atomic.AtomicInteger;



public class Server {
    private static final int PORT=18888;
    private static final int MAX_LENGTH=1024;

    private DatagramSocket datagramSocket;

    /**
     * 记录响应次数,线程安全用原子变量保证
     */
    private AtomicInteger modCount;

    private LinkedBlockingQueue<DatagramPacket> receiveQueue;
    private LinkedBlockingQueue<DatagramPacket> responseQueue;

    public Server(){
        try {
            datagramSocket = new DatagramSocket(PORT);
            receiveQueue =  new LinkedBlockingQueue<DatagramPacket>();
            responseQueue =  new LinkedBlockingQueue<DatagramPacket>();
            modCount = new AtomicInteger(0);
        } catch (SocketException e) {
            e.printStackTrace();
        }
    }

    /**
     * 接收线程,监听端口,收到数据包后直接放到接收队列
     */
    private void startReceive(){
        System.out.println("接收开启");
        //三个接收线程
        for(int i=0;i<3;++i){
            new Thread(()->{
                while(true){
                    //阻塞接收, 收到后就放入队列
                    byte[] buffer =new byte[MAX_LENGTH];
                    DatagramPacket receivePacket = new DatagramPacket(buffer,buffer.length);
                    try {
                        datagramSocket.receive(receivePacket);
                        receiveQueue.put(receivePacket);
                    } catch (IOException | InterruptedException e) {
                        e.printStackTrace();
                    }
                }

            },"receiveThread").start();
        }
    }

    /**
     * 处理线程,从接收队列取数据包,计算后封装新的包放入发送队列
     */
    private void startProcess(){
        System.out.println("处理开启");
        //开3个处理线程
        for(int i=0; i<3 ;++i){
            new Thread(()->{
                while(true){
                    DatagramPacket receivePacket=null;
                    try {
                        //阻塞式取数据
                        receivePacket = receiveQueue.take();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                    String parameter  = new String(receivePacket.getData(),0,receivePacket.getLength());
                    String[] opers = parameter.split("\n");
                    double num1 = Double.parseDouble(opers[1]);
                    double num2 = Double.parseDouble(opers[2]);
                    //System.out.println(num1 +" "+opers[0]+" "+num2);
                    double res =0;
                    switch(opers[0]){
                        case "+" :
                            res = num1+num2;
                            break;
                        case "-":
                            res=num1-num2;
                            break;
                        case "x":
                            res=num1*num2;
                            break;
                        case "/":
                            res=num1/num2;
                            break;
                    }

                    //在原来的数据包上修改一下,省得再new一个
                    receivePacket.setData((res+"").getBytes());
                    try {
                        //放入相应队列
                        responseQueue.put(receivePacket);
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }

                }
            }).start();
        }
    }

    /**
     * 从发送队列取数据包,发出去
     */
    private void startResponse(){
        System.out.println("响应开启");
        //开三个发送线程
        for(int i=0;i<3;++i){
            new Thread(()->{
                while(true){
                    try {
                        DatagramPacket responsePacket = responseQueue.take();
                        datagramSocket.send(responsePacket);
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    } catch (IOException e) {
                        e.printStackTrace();
                    }

                    System.out.println("响应: "+ modCount.addAndGet(1));
                    //addModCount(); //modCount+1
                }
            },"responseThread").start();
        }
    }



    /**
     * 不知道在哪里关socket了,,就放这里吧 垃圾回收的时候关233333
     */
    protected void finalize(){
        if(datagramSocket!=null){
            datagramSocket.close();
        }
    }

    public static void main(String[] args) {
        Server server = new Server();

        server.startResponse();
        server.startProcess();
        server.startReceive();

    }
}
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82
  • 83
  • 84
  • 85
  • 86
  • 87
  • 88
  • 89
  • 90
  • 91
  • 92
  • 93
  • 94
  • 95
  • 96
  • 97
  • 98
  • 99
  • 100
  • 101
  • 102
  • 103
  • 104
  • 105
  • 106
  • 107
  • 108
  • 109
  • 110
  • 111
  • 112
  • 113
  • 114
  • 115
  • 116
  • 117
  • 118
  • 119
  • 120
  • 121
  • 122
  • 123
  • 124
  • 125
  • 126
  • 127
  • 128
  • 129
  • 130
  • 131
  • 132
  • 133
  • 134
  • 135
  • 136
  • 137
  • 138
  • 139
  • 140
  • 141
  • 142
  • 143
  • 144
  • 145
  • 146
  • 147
  • 148
  • 149
  • 150
  • 151
  • 152
  • 153
  • 154
  • 155



原文地址:访问原文地址
快照地址: 访问文章快照