zoukankan      html  css  js  c++  java
  • java并发压力测试

    package com.test;

    import java.io.BufferedReader;
    import java.io.File;
    import java.io.FileInputStream;
    import java.io.FileNotFoundException;
    import java.io.InputStreamReader;
    import java.io.PrintWriter;
    import java.io.UnsupportedEncodingException;
    import java.net.HttpURLConnection;
    import java.net.URL;
    import java.util.HashMap;
    import java.util.Map;
    import java.util.concurrent.ExecutorService;
    import java.util.concurrent.Executors;
    import java.util.concurrent.Semaphore;

    public class Test {
     private static int thread_num=150;
     private static int client_num=500;
     private static Map keywordMap=new HashMap();
     
     static {
      InputStreamReader isr;
      try {
       isr = new InputStreamReader(new FileInputStream(new File("D:/clicks.txt")),"GBK");
       BufferedReader buffer=new BufferedReader(isr);
       String line="";
       while ((line=buffer.readLine())!=null) {
        keywordMap.put(line.substring(0, line.lastIndexOf(":")),"");      
       }
      } catch (Exception e) {
       // TODO Auto-generated catch block
       e.printStackTrace();
      
     }

     public static void main(String[] args) {
      int size=keywordMap.size();
      ExecutorService exec=Executors.newCachedThreadPool();
      // 50个线程可以同时访问
      final Semaphore semp=new Semaphore(thread_num);
      // 模拟2000个客户端访问
      for (int index = 0; index < client_num; index++) {
       final int NO = index;
       Runnable run = new Runnable() {
        public void run() {
         try {     
         // 获取许可
         semp.acquire();
         System.out.println("Thread:" + NO);
         //System.out.println("semp:" + semp);
         String host = "http://192.168.30.31:8088/AndroidWebService";
         
         //System.out.println(host + para);
         System.out.println("host--"+host);
         URL url=new URL(host);// 此处填写供测试的url
         HttpURLConnection connection=(HttpURLConnection)url.openConnection();
         //connection.setRequestMethod("POST");
         //connection.setRequestProperty("Proxy-Connection","Keep-Alive");
         connection.setDoOutput(true);
         connection.setDoInput(true);
         PrintWriter out=new PrintWriter(connection.getOutputStream());     
         out.flush();
         out.close();
         BufferedReader in=new BufferedReader(new InputStreamReader(connection.getInputStream()));
         String line="";
         String result="";
         while ((line=in.readLine())!=null) {
          result +=line;
         }
         System.out.println("result--"+result);
         // Thread.sleep((long) (Math.random()) * 1000);
         // 释放
         System.out.println("第:" + NO + " 个");
         semp.release();
         
         } catch (Exception e) {
          e.printStackTrace();
         }
        }
       };
       exec.execute(run);
      }
      // 退出线程池
      exec.shutdown();
     }
     private static String getRandomSearchKey(final int no){
      String ret="";
      int size=keywordMap.size();
      // int wanna = (int) (Math.random()) * (size - 1);
      ret = (keywordMap.entrySet().toArray())[no].toString();
      ret = ret.substring(0, ret.lastIndexOf("="));
      System.out.println("ret--"+" " + ret);
      return ret;
     }

    }

     

     

    http://www.blogjava.net/alinglau36/archive/2010/05/28/322118.html

     

  • 相关阅读:
    次小生成树
    乘法逆元(递推)
    乘法逆元(快速幂)
    带偏移量的并查集
    Tarjan 强连通分量
    Luogu_P2461 [SDOI2008]递归数列 【题解】 矩阵乘法
    Luogu_P2243 电路维修【题解】 双端队列bfs
    Luogu_ P2962 [USACO09NOV] 灯 【题解】 双向搜索
    luogu_P2044【题解】 随机数生成器 矩阵乘法
    luogu_P2054 bzoj 1965 洗牌 【题解】 快速幂 快速乘
  • 原文地址:https://www.cnblogs.com/liuzhuqing/p/7480460.html
Copyright © 2011-2022 走看看