Scheduling a Concurrent program

EBS中的Program是可以根据需求周期性运行的,比如‘Purge Logs and Closed System Alerts’ Program,我们需要每天运行来清理日渐庞大的日志表,周期性运行Program的方法。

路径:Submit Request > Schedule
1.As Soon as Possible:立即运行你的Program

2.Once:在一个具体的时间点上运行Program

3.Periodically:周期的运行你的Program,每分钟/每小时/每天/每周/每月,并制定开始时间和结束时间。

4.On Specific Days:在特定的那几天运行


然后你在Request列表里就能看到你的Scheduled Program。Status为Scheduled,Phase:Pending

或者你用下边脚本,也能看到你的Scheduled Program
select r.request_id, p.user_concurrent_program_name || case when p.user_concurrent_program_name = 'Report Set' then (select ' - ' || s.user_request_set_name from apps.fnd_request_sets_tl s where s.application_id = r.argument1 and s.request_set_id = r.argument2 and language = 'US' ) when p.user_concurrent_program_name = 'Check Periodic Alert' then (select ' - ' || a.alert_name from apps.alr_alerts a where a.application_id = r.argument1 and a.alert_id = r.argument2 and language = 'US' ) end concurrent_program_name, decode(c.class_type, 'P', 'Periodic', 'S', 'On Specific Days', 'X', 'Advanced', c.class_type ) schedule_type, case when c.class_type = 'P' then 'Repeat every ' || substr(c.class_info, 1, instr(c.class_info, ':') - 1) || decode(substr(c.class_info, instr(c.class_info, ':', 1, 1) + 1, 1), 'N', ' minutes', 'M', ' months', 'H', ' hours', 'D', ' days') || decode(substr(c.class_info, instr(c.class_info, ':', 1, 2) + 1, 1), 'S', ' from the start of the prior run', 'C', ' from the completion of the prior run') when c.class_type = 'S' then nvl2(dates.dates, 'Dates: ' || dates.dates || '. ', null) || decode(substr(c.class_info, 32, 1), '1', 'Last day of month ') || decode(sign(to_number(substr(c.class_info, 33))), '1', 'Days of week: ' || decode(substr(c.class_info, 33, 1), '1', 'Su ') || decode(substr(c.class_info, 34, 1), '1', 'Mo ') || decode(substr(c.class_info, 35, 1), '1', 'Tu ') || decode(substr(c.class_info, 36, 1), '1', 'We ') || decode(substr(c.class_info, 37, 1), '1', 'Th ') || decode(substr(c.class_info, 38, 1), '1', 'Fr ') || decode(substr(c.class_info, 39, 1), '1', 'Sa ')) end schedule, r.requested_start_date next_run, case when p.user_concurrent_program_name != 'Report Set' and p.user_concurrent_program_name != 'Check Periodic Alert' then r.argument_text end argument_text, r.hold_flag on_hold, c.date1 start_date, c.date2 end_date, c.class_info, user_name from apps.fnd_concurrent_requests r, applsys.fnd_conc_release_classes c, apps.fnd_concurrent_programs_tl p, apps.fnd_user usr, (SELECT release_class_id, substr(max(SYS_CONNECT_BY_PATH(s, ' ')), 2) dates ,a FROM (select release_class_id, rank() over(partition by release_class_id order by s) a, s from (select c.class_info, l, c.release_class_id, decode(substr(c.class_info, l, 1), '1', to_char(l)) s from (select level l from dual connect by level <= 31), apps.fnd_conc_release_classes c where c.class_type = 'S') where s is not null) CONNECT BY PRIOR (a || release_class_id) = (a - 1) || release_class_id group by release_class_id,a) dates where r.phase_code = 'P' and c.application_id = r.release_class_app_id and c.release_class_id = r.release_class_id and nvl(c.date2, sysdate + 1) > sysdate and c.class_type is not null and p.concurrent_program_id = r.concurrent_program_id and p.application_id = r.program_application_id and p.language = 'US' and dates.release_class_id(+) = r.release_class_id and usr.user_id = requested_by order by requested_by,on_hold, next_run;

转载请注明出处:http://blog.youkuaiyun.com/pan_tian/article/details/7699981

======EOF======

操作系统代码实现:Number Project Name Content Summary State Type 一、Process Scheduling Algorithm Simulation 1、 Simulate the operation of the round-robin algorithm for process scheduling. 2、 Create at least 15 processes and output their scheduling situation under the scheduling algorithm mentioned above and output it to theterminal to check the execution of the algorithm. 3、 The output should include the arrival time of the processes, the end time, and the average execution time. Essential. General 二、Readers-Writer Problem Implmentation 1、 A data set is shared among several concurrent processes: Readers – only read the data set; they do not perform any updates. Writers – can both read and write. 2、 Problem – allow multiple readers (at most 8) to read at the same time. Only one single writer can access the shared data at the same time. Essential. General 三、Program for Least Recently used Algorithm 1、 Create a page access sequence (page number range 0-18) using a random function. The sequence length is 54 and assume that the number of main memory frames allocated to the thread is 6, that is, M = 6. 2、 Implement the LRU algorithm for page replacement on the above access sequence. 3、 Output the page replacement sequence and the page fault rate. Essential. General Requirements 1、 For each experiment project, submit a design report and code. The code should be implemented in C++. The requirements are as follows: a) The content of the design report should include the design ideas and implementation. b) The results of the design report should include testing and running results (screenshots of screen outputs). c) The conclusion of the design report should summarize the problems encountered, the solutions and experiences during the implementation process.
06-08
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值