多线程 小程序

3 篇文章 0 订阅
package com.xmjr.test;
public class Banyungong implements Runnable {
    private Computer computer = null;


       public Banyungong(Computer computer) {
        this.computer = computer;
    }


    @Override
    public void run() {
        for (int i = 0; i < 50; i++) {
            try {
                Thread.sleep(100);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }


            computer.get();


        }


    }


}






package com.xmjr.test;


public class Computer {
    private String shubiao = "shubiaoA";
    private String zhuji = "zhujiA";
    private String jianpan = "jianpanA";


    private boolean flag = false;


    public synchronized void get() {


        if (flag) {
            try {
                super.wait();
            } catch (Exception e) {
                e.printStackTrace();
            }
        }


        try {
            Thread.sleep(300);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }


        System.out.println(getZhuji() + "-->" + getShubiao() + "-->" + jianpan);


        flag = true;
        super.notify();
    }


    /**
     * @return the jianpan
     */
    public String getJianpan() {
        return jianpan;
    }


    /**
     * @return the shubiao
     */
    public String getShubiao() {
        return shubiao;
    }


    /**
     * @return the zhuji
     */
    public String getZhuji() {
        return zhuji;
    }


    public synchronized void set(String shubiao, String jianpan, String zhuji) {


        if (!flag) {
            try {
                super.wait();
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        setJianpan(jianpan);
        try {
            Thread.sleep(500);
        } catch (Exception e) {
            e.printStackTrace();


        }
        setShubiao(shubiao);
        setZhuji(zhuji);


        flag = false;
        super.notify();


    }


    /**
     * @param jianpan
     *            the jianpan to set
     */
    public void setJianpan(String jianpan) {
        this.jianpan = jianpan;
    }


    /**
     * @param shubiao
     *            the shubiao to set
     */
    public void setShubiao(String shubiao) {
        this.shubiao = shubiao;
    }


    /**
     * @param zhuji
     *            the zhuji to set
     */
    public void setZhuji(String zhuji) {
        this.zhuji = zhuji;
    }


}





package com.xmjr.test;


public class Maker implements Runnable {


    private Computer computer = null;


    public Maker(Computer computer) {
        this.computer = computer;
    }


    @Override
    public void run() {
        boolean b = false;
        for (int i = 0; i < 50; i++) {
            if (b) {
                computer.set("鼠标a" + i, "键盘a" + i, "主机a" + i);
                b = false;
            } else {
                computer.set("鼠标b" + i, "键盘b" + i, "主机b" + i);
                b = true;
            }


        }
    }
}





package com.xmjr.test;


public class Test {


    public static void main(String[] args) {
        Computer computer = new Computer();
        Maker maker = new Maker(computer);
        Banyungong ban = new Banyungong(computer);


        Thread threadMaker = new Thread(maker);


        Thread threadBan = new Thread(ban);


        threadMaker.start();
        try {
            Thread.sleep(100);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        threadBan.start();


    }


}

多线程 求质数 返回数组中的最大值 bool isPrime(long x) { if (x <= 1) return false; if (x == 2) return true; for (long i = 2; i <= ceil(sqrt((long double)x));i++) if (x%i == 0) return false; return true; } DWORD WINAPI findPrime(void* p) { long result=0; int l = stc(p)->lower, u = stc(p)->uper; int t_id=GetCurrentThreadId(); for (int i = l; i <= u;i++) if (isPrime(i)) { result++; } DWORD dReturn = WaitForSingleObject(mutex_mul_result_h, INFINITE); mul_result += result; ReleaseMutex(mutex_mul_result_h); //EnterCriticalSection(&gCRITICAL_SECTION_Printf); //printf("%d,%d,%d,%d\n", l, u, result,t_id); //fflush(stdout); //LeaveCriticalSection(&gCRITICAL_SECTION_Printf); return 0; } //dispatcher void dispatch() { DWORD Status; timer tm; tm.start(); //srand(time(NULL)); long step = STEP;//ceil(double(TEST/10)); handlenum = 0; for (int i = 1; i <= TEST;) { i += step; handlenum++; } handle_array=new HANDLE[handlenum]; Thread_id = new DWORD[handlenum ]; arg = new FP_ARG[handlenum]; InitializeCriticalSection(&gCRITICAL_SECTION_Printf); mutex_mul_result_h = CreateMutex(NULL, false, mutex_mul_result); handlenum = 0; for (int i = 1; i <= TEST;) { arg[handlenum].lower = i; arg[handlenum].uper = (i + step-1>TEST) ? TEST : i + step-1; handle_array[handlenum]=(HANDLE)CreateThread(NULL, 0, findPrime, &arg[handlenum], 0, &Thread_id[handlenum]); /*EnterCriticalSection(&gCRITICAL_SECTION_Printf); printf("lower:%d uper:%d thread_id:%d\n", arg[handlenum].lower, arg[handlenum].uper,Thread_id[handlenum]); LeaveCriticalSection(&gCRITICAL_SECTION_Printf);*/ i += step; handlenum++; } tm.stop(); Sleep(1000); printf("there are %d threads\n", handlenum); printf("the multithreads use %f msc\n", tm.read()); } //the number of 1-1000000 Primenumber void s_finePrime() { timer tm; long result = 0; tm.start(); for (int i = 1; i <= TEST; i++) if (isPrime(i)) result++; tm.stop(); printf("Single thread result is %d\n", result); printf("Single thread use %f msc\n", tm.read()); } int _tmain(int argc, _TCHAR* argv[]) { dispatch(); WaitForMultipleObjects(handlenum, handle_array, true, INFINITE);//不起作用 printf("the multithreads reslut is %d\n", mul_result); CloseHandle(mutex_mul_result_h); DeleteCriticalSection(&gCRITICAL_SECTION_Printf); s_finePrime(); system("pause"); return 0; }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值