Semaphore使用之公平锁

闲话少说,直接上demo:

package com.ilucky.test.jdk.util.concurrent;

import java.util.Date;
import java.util.concurrent.Semaphore;

/**
 * 公平锁和非公平锁: 
 * 默认使用非公平锁,因为非公平锁的的效率要高于公平锁。但是非公平锁会导致"线程饿死"的问题.
 * 所以, 要结合具体的业务场景进行选择.
 * 
 * @author IluckySi
 *
 */
public class SemaphoreTest2 {

    public static void main(String[] args) {
        //Semaphore s = new Semaphore(1, true);
        Semaphore s = new Semaphore(2, true);
        new SemaphoreTestT21(s).start();
        new SemaphoreTestT2(s).start();
        new SemaphoreTestT3(s).start();
    }
}

class SemaphoreTestT21 extends Thread {

    private Semaphore s;

    SemaphoreTestT21(Semaphore s) {
        this.s = s;
    }

    public void run() {
        try {
            while(true) {
                s.acquire();
                System.out.println(new Date() + "name =" + Thread.currentThread().getName());
                Thread.sleep(2000);
                s.release();
            }
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}

class SemaphoreTestT22 extends Thread {

    private Semaphore s;

    SemaphoreTestT22(Semaphore s) {
        this.s = s;
    }

    public void run() {
        try {
            while(true) {
                s.acquire();
                System.out.println(new Date() + "name =" + Thread.currentThread().getName());
                Thread.sleep(2000);
                s.release();
            }
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}

class SemaphoreTestT23 extends Thread {

    private Semaphore s;

    SemaphoreTestT23(Semaphore s) {
        this.s = s;
    }

    public void run() {
        try {
            while(true) {
                s.acquire();
                System.out.println(new Date() + "name =" + Thread.currentThread().getName());
                Thread.sleep(2000);
                s.release();
            }
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}
/**
注意: 观察线程顺序, 另外观察时间:
Semaphore s = new Semaphore(1, true);
Fri May 12 12:22:21 GMT+08:00 2017name =Thread-0
Fri May 12 12:22:23 GMT+08:00 2017name =Thread-1
Fri May 12 12:22:25 GMT+08:00 2017name =Thread-2
Fri May 12 12:22:27 GMT+08:00 2017name =Thread-0
Fri May 12 12:22:29 GMT+08:00 2017name =Thread-1
Fri May 12 12:22:31 GMT+08:00 2017name =Thread-2

Semaphore s = new Semaphore(2, true);
Fri May 12 14:55:10 GMT+08:00 2017name =Thread-1
Fri May 12 14:55:10 GMT+08:00 2017name =Thread-0
Fri May 12 14:55:12 GMT+08:00 2017name =Thread-0
Fri May 12 14:55:12 GMT+08:00 2017name =Thread-2
Fri May 12 14:55:14 GMT+08:00 2017name =Thread-1
Fri May 12 14:55:14 GMT+08:00 2017name =Thread-2
Fri May 12 14:55:16 GMT+08:00 2017name =Thread-0
Fri May 12 14:55:16 GMT+08:00 2017name =Thread-1
Fri May 12 14:55:18 GMT+08:00 2017name =Thread-2
Fri May 12 14:55:18 GMT+08:00 2017name =Thread-0
Fri May 12 14:55:20 GMT+08:00 2017name =Thread-1
Fri May 12 14:55:20 GMT+08:00 2017name =Thread-2
Fri May 12 14:55:22 GMT+08:00 2017name =Thread-0
Fri May 12 14:55:22 GMT+08:00 2017name =Thread-1
Fri May 12 14:55:24 GMT+08:00 2017name =Thread-2
Fri May 12 14:55:24 GMT+08:00 2017name =Thread-0
*/
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值