zoukankan      html  css  js  c++  java
  • java 定时任务线程池的使用

    方法1
     ThreadPool tp = new ThreadPool(128);
            new Timer().schedule(new TimerTask() {
                @Override
                public void run() {
                    System.out.println(new Date());
                    /*
                     * List<Job> jobs = mapper.JobListNotDone(); for(Job job : jobs) { Task task =
                     * new Task(job.getUuid()); tp.IssueOperation(task); }
                     */
                }
            },1000,3000);
        }
    方法二
    public class Main{
        
        
        static class LongRunningTask extends TimerTask{
     
        @Override
        public void run() {
             
            System.out.println("Long running finished"+DateUtil.now());
           
        }
        
        /*
         * public static void main(String[] args){ int sleepTime=2*1000;
         * ScheduledExecutorService scheduledExecutor =
         * Executors.newSingleThreadScheduledExecutor();
         * scheduledExecutor.scheduleAtFixedRate( new Runnable() {
         * 
         * @Override public void run() {
         * System.out.println("ScheduledExecutorService方式执行一次定时任务"); } } ,1,sleepTime,
         * TimeUnit.SECONDS); }
         */   
        
    }
    static class  FixedDelayTask extends TimerTask{
     
        @Override
        public void run() {
            System.out.println(DateUtil.now());
        }
    }
        public static void main(String[] args)  {
              System.out.println(DateUtil.now());
              ScheduledExecutorService scheduledExecutorService = Executors.newScheduledThreadPool(500);
              scheduledExecutorService.schedule(new LongRunningTask(),5000,TimeUnit.MILLISECONDS);
              scheduledExecutorService.schedule(new LongRunningTask(),10000,TimeUnit.MILLISECONDS);
              scheduledExecutorService.schedule(new LongRunningTask(),15000,TimeUnit.MILLISECONDS);
           
          //scheduledExecutorService.scheduleWithFixedDelay(new FixedDelayTask(),100,1000,TimeUnit.MILLISECONDS);
        }
    }

    转自 

    * https://blog.csdn.net/huawuqueisme/article/details/89715385?utm_medium=distribute.pc_relevant.none-task-blog-title-2&spm=1001.2101.3001.4242

  • 相关阅读:
    NYOJ 91 阶乘之和
    NYOJ 47 过河问题
    NYOJ 12 喷水装置(二)
    NYOJ 78 圈水池(凸包问题)
    NYOJ 523 亡命逃窜( bfs )
    NYOJ 564 最优对称路径(湖南省第七届大学生计算机程序设计竞赛)
    NYOJ 491 幸运三角形(bitset)
    排列组合 C(n,k)= C(n1)+C(n1,k1) 对应于杨辉三角
    Android (服务Service)
    Android (界面编程#5ProgressDialog)
  • 原文地址:https://www.cnblogs.com/hellohero55/p/13698190.html
Copyright © 2011-2022 走看看