Effective Decision Support in Near-Real Time

 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Complex Event Processing RSS News Effective Decision Support in Near-Real Time
# 1  
Old 07-25-2010
Effective Decision Support in Near-Real Time

INDUSTRY VIEW by Allen Avery, AutomationWorld.com With increased data throughput and higher data resolutions, historians have also become a foundation for plant asset management initiatives, thanks to new visibility and trending tools. Today’s historians also support techniques, such as complex event processing, which can analyze multiple streams of plant data in real time to identify and diagnose [...]

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

2 More Discussions You Might Find Interesting

1. Programming

Real, effective and saved user id in C program

I figured it out by now. (0 Replies)
Discussion started by: Ralph
0 Replies

2. UNIX for Dummies Questions & Answers

Real and Effective IDs

Can anyone explain me in details of Real and Effective IDs (6 Replies)
Discussion started by: kkalyan
6 Replies
Login or Register to Ask a Question
sched.h(3HEAD)							      Headers							    sched.h(3HEAD)

NAME
sched.h, sched - execution scheduling SYNOPSIS
#include <sched.h> DESCRIPTION
The <sched.h> header defines the sched_param structure, which contains the scheduling parameters required for implementation of each sup- ported scheduling policy. This structure contains the following member: int sched_priority process execution scheduling priority Each process is controlled by an associated scheduling policy and priority. Associated with each policy is a priority range. Each policy definition specifies the minimum priority range for that policy. The priority ranges for each policy may overlap the priority ranges of other policies. The scheduling policies are indicated by the values of the following symbolic constants: SCHED_OTHER Processes are scheduled according to the traditional Time-Sharing Class (TS) policy as described in priocntl(2). SCHED_FIFO Processes are scheduled in the Real-Time (RT) scheduling class, according to the First-In-First-Out (FIFO) policy. Pro- cesses scheduled to this policy, if not preempted by a higher priority or interrupted by a signal, will proceed until com- pletion. SCHED_RR Processes are scheduled in the Real-Time (RT) scheduling class, according to the Round-Robin (RR) policy. Processes sched- uled to this policy, if not preempted by a higher priority or interrupted by a signal, will execute for a time period, returned by sched_rr_get_interval(3C) or by the system. SCHED_IA Processes are scheduled according to the Inter-Active Class (IA) policy as described in priocntl(2). SCHED_FSS Processes are scheduled according to the Fair-Share Class (FSS) policy as described in priocntl(2). SCHED_FX Processes are scheduled according to the Fixed-Priority Class (FX) policy as described in priocntl(2). The values of these constants are distinct. Inclusion of the <sched.h> header will make visible symbols defined in the header <time.h>. SEE ALSO
priocntl(2), sched_get_priority_max(3C), sched_get_priority_min(3C), sched_rr_get_interval(3C), time.h(3HEAD) SunOS 5.11 1 Apr 2008 sched.h(3HEAD)