TaskScheduler is a component of Microsoft Windows that provides the ability to schedule the launch of programs ... Fasoltd publisher The Syracuse Newspapers accessdate 2007 10 06 ref but was renamed to TaskScheduler in Windows 98 . The Windows Event Log service must be running before the TaskScheduler starts up. Versions TaskScheduler 1.0 TaskScheduler 1.0 is included with Windows 2000 , Windows XP and Windows ... About the TaskScheduler accessdate 2007 10 06 ref It runs as a Windows Service , and the task ... 95 , Windows 98 and Windows Me , the TaskScheduler runs as an application mstask.exe . It also ... service . TaskScheduler 1.0 exposes an API to programmatically create tasks. It is accessed via ... XP TaskScheduler. ref http www.microsoft.com downloads details.aspx?displaylang en&FamilyID 601d75e2 f907 4e51 ad88 adb818df1d27 TaskScheduler Using VBScript ref TaskScheduler 2.0 Image Windows Vista Task Scheduler.png thumb right TaskScheduler 2.0 in Windows 7 TaskScheduler 2.0 was introduced ... to running tasks on scheduled times or specified intervals, TaskScheduler 2.0 also supports calendar .... TaskScheduler includes a number of actions built in, spanning a number of applications including .... Custom actions can also be specified using the TaskScheduler API. TaskScheduler keeps a history ... technet windowsvista mgmntops taskschd.mspx title Windows Vista TaskScheduler date March 3, 2006 accessdate 2006 04 24 publisher Microsoft TechNet ref . Windows Vista uses TaskScheduler 2.0 ... tasks in Windows Vista ref consequently, the TaskScheduler service can no longer be disabled except with a simple registry tweak . TaskScheduler 2.0 exposes an API to programmatically create tasks ... TaskScheduler 2.0 author Kenny Kerr publisher MSDN accessdate 2007 10 06 ref The Windows API does not, however, include a Managed code managed wrapper for TaskScheduler. The TaskScheduler API is also ... url http msdn2.microsoft.com en us library aa383608.aspx title TaskScheduler Reference accessdate ... more details
Unreferenced date December 2009 In computer programming , the scheduler pattern is a software design pattern . It is a Concurrency computer science concurrency pattern used to explicitly control when thread software engineering thread s may execution computers execute single threaded source code code , like write operation to a file. The scheduler pattern uses an object that explicitly sequences waiting threads. It provides a mechanism to implement a scheduling policy , but is independent of any specific scheduling policy &mdash the policy is encapsulated in its own class and is reusable. The Read write lock pattern read write lock pattern is usually implemented using the scheduler pattern to ensure fairness in scheduling. Note that the scheduler pattern adds significant overhead beyond that required to call a synchronized method computer science method . The scheduler pattern is not quite the same as the scheduled task pattern used for real time systems. See also Mediator pattern DEFAULTSORT Scheduler Pattern Category Software design patterns Comp sci stub ru Scheduler ... more details
Deadline scheduler is an I O scheduling I O scheduler for the Linux kernel which was written in 2002 by Jens Axboe . Overview The goal of the Deadline scheduler is to attempt to guarantee a start service time for a request ref Jens Axboe, cite web title Deadline IO scheduler tunables publisher url http www.mjmwired.net kernel Documentation block deadline iosched.txt accessdate 2010 04 20 date 2002 11 11 ref . It does that by imposing a deadline on all I O operations to prevent starvation of requests. It also maintains two deadline Queue data structure queues , in addition to the sorted queues both read and write . Deadline queues are basically sorted by their deadline the expiration time , while the sorted queues are sorted by the sector number. Before serving the next request, the Deadline scheduler decides which queue to use. Read queues are given a higher priority, because Process computing processes usually block on read operations. Next, the Deadline scheduler checks if the first request in the deadline queue has expired. Otherwise, the scheduler serves a batch of requests from the sorted queue. In both cases, the scheduler also serves a batch of requests following the chosen request in the sorted queue. By default, read requests have an expiration time of 500 ms, write requests expire in 5 seconds. The kernel docs suggest this is the preferred scheduler for database systems, especially if you have Tagged Command Queuing TCQ aware disks, or any system with high disk performance ref cite web title Linux IO Scheduler publisher url http www.wlug.org.nz LinuxIoScheduler accessdate 2007 08 10 ref . Other I O schedulers CFQ Anticipatory scheduling Anticipatory scheduler Noop scheduler Sources http kerneltrap.org node 431 A Deadline I O Scheduler Jens Axboe, http www.mjmwired.net kernel Documentation block deadline iosched.txt Deadline IO scheduler tunables , Linux kernel ... div Linux stub Category Disk scheduling algorithms fr Deadline scheduler ... more details
The NOOP scheduler is the simplest I O scheduling I O scheduler for the Linux kernel . This scheduler was developed by Jens Axboe . Overview The NOOP scheduler inserts all incoming I O requests into a simple, unordered FIFO queue and implements request merging. The scheduler assumes I O performance optimization will be handled at some other layer of the I O hierarchy e.g., at the block device by an intelligent Host Bus Adapter HBA such as a Serial Attached SCSI SAS RAID controller or by an externally attached controller such as a storage subsystem accessed through a switched Storage Area Network ref cite web title Choosing an I O Scheduler for Red Hat Enterprise Linux 4 and the 2.6 Kernel publisher Red Hat url http www.redhat.com magazine 008jun05 features schedulers accessdate 2007 08 10 ref NOOP scheduler is best used with solid state devices such as flash memory or in general with devices that do not depend on mechanical movement to access data meaning typical hard disk drive technology consisting of seek time primarily, plus rotational latency . Such non mechanical devices do not require re ordering of multiple I O requests, a technique that groups together I O requests that are physically close together on the disk, thereby reducing average seek time and the variability of I O service time. ref cite web title Switching IO Schedulers on runtime publisher url http www.linuxhowtos.org System iosched.htm accessdate 2007 08 10 ref Other I O schedulers CFQ Anticipatory scheduling Anticipatory scheduler Deadline scheduler Notes and references See http en.wikipedia.org wiki Wikipedia Footnotes for an explanation of how to generate footnotes using the ref and ref tags and the tag below div class references small style moz column count 2 column count 2 references div Linux stub Category Disk scheduling algorithms fr Noop scheduler ... more details
Unreferenced stub auto yes date December 2009 Orphan date December 2009 In computer science , Atropos is a real time computing real time scheduling algorithm developed at University of Cambridge Cambridge University . It combines the Earliest deadline first scheduling Earliest Deadline First algorithm with a best effort scheduler to make use of slack time , while exercising strict admission control . DEFAULTSORT Atropos Scheduler Category Scheduling algorithms Category Real time computing Comp sci stub ... more details
Scheduler Activations is a thread computer science thread ing mechanism that, when implemented in an operating system s process Scheduling computing scheduler , provides kernel level thread functionality with user level thread flexibility and performance. This mechanism uses a so called N M strategy that maps some N number of application threads onto some M number of kernel entities, or virtual processors. This is a compromise between kernel level 1 1 and user level N 1 threading. In general, N M threading systems are more complex to implement than either kernel or user threads, because both changes to kernel and user space code are required. Scheduler Activations was proposed by Anderson, Bershad, Lazowska, and Levy in http www.cs.washington.edu homes bershad Papers p53 anderson.pdf Scheduler Activations Effective Kernel Support for the User Level Management of Parallelism in 1991. It was implemented in the NetBSD kernel by Nathan Williams ref http web.mit.edu nathanw www usenix freenix sa freenix sa.html An Implementation of Scheduler Activations on the NetBSD Operating System ref but has since been abandoned in favor of 1 1 threading ref http www.netbsd.org changes changes 5.0.html newlock2 Significant changes from NetBSD 4.0 to 5.0 Bot generated title ref . FreeBSD had a similar threading implementation called Kernel Scheduled Entities which is also being retired in favor of 1 1 threading. Scheduler activations were also implemented as a patch for the Linux kernel by Vincent Danjean http www id.imag.fr Laboratoire Membres Danjean Vincent linux activations.html Linux Activations , the user level part being done in the http runtime.bordeaux.inria.fr marcel Marcel thread library . References references Category Threads ja Scheduler activations ... more details
Unreferenced date September 2007 PTC Scheduler is a Windows based batch scheduling application. Via the use of either Agents or Telnet connections, PTC Scheduler is able to schedule and monitor batch processes on the following platforms Microsoft Windows Windows NT XP 2000 2003 Vista Sun Solaris 8 9 10 Red Hat Linux 7.3 Red Hat Fedora 4 AIX GCOS 7 Overview Some of the features of PTC Scheduler are Monitoring changes in batch duration to allow alerting of abnormal job execution Alerting upon job failure via SMS, Telephony & Email Message users for confirmation of steps to take during the batch execution Dashboard display of job execution status History PTC Software is a UK based company which specialises in the development and distribution of Enterprise Systems Management ESM software products. PTC was formed in 1983 to provide a range of Systems Management utilities to the users of Honeywell Bull s large mainframe computers. PTC s first package was an early Job Scheduling solution called Job Flow Control Facility . Indeed, this was probably one of the first job scheduling systems available anywhere. As the Honeywell Bull marketplace has eroded over the last twenty years, so PTC has expanded its product set to support many operating systems including Unix, Windows and Vax, whilst remaining firmly rooted to the original areas of expertise in Systems Management. The latest Scheduling tool, PTC Scheduler, is the fourth generation product and encompasses over twenty years of direct experience gained from the needs and wishes of many large 200 servers and small customers 1 5 servers . The new generation of tools has been expanded into the areas of service availability and management. Areas which are becoming increasingly important for Technology departments or companies who wish .... In recent years, PTC Scheduler has been enhanced to provide scheduling for various housing applications ... 20scheduler.asp title PTC Software Ltd cross platform batch job scheduler refend Category Job scheduling ... more details
Infobox Software name ULE scheduler logo screenshot caption collapsible author Jeff Roberson ref cite web url http www.freebsd.org cgi man.cgi?query sched ule&apropos 0&sektion 0&manpath FreeBSD 7.1 RELEASE&format html title SCHED ULE 4 man page accessdate 2008 09 02 ref developer released 26 January 2003 ref cite web url http www.freebsd.org cgi cvsweb.cgi src sys kern sched ule.c title FreeBSD CVS log accessdate 27 August 2008 ref latest preview version latest preview date frequently updated yes Release version update? Don t edit this page, just click on the version number programming language C programming language C operating system FreeBSD platform size language status genre license BSD licenses BSD 2 clause website ULE is the default Scheduling computing scheduler for the FreeBSD operating system versions 7.1 and forward for the i386 and AMD64 architectures. ref cite web url http www.freebsd.org releases 7.1R announce.html title FreeBSD 7.1 RELEASE Release Announcement retrieved on 05 January 2009 ref It was introduced in FreeBSD version 5 ref cite web url http www.usenix.org event bsdcon03 tech full papers roberson roberson.pdf title ULE A Modern Scheduler for FreeBSD accessdate 23 June 2008 ref , but it was disabled by default for a time in favor of the traditional BSD scheduler until it reached maturity. The BSD scheduler does not make full use of Symmetric multiprocessing SMP or Simultaneous multithreading SMT , which is important in modern computing environments. The primary goal of the ULE project is to make better use of Symmetric multiprocessing SMP and Simultaneous multithreading SMT environments. ULE should improve performance in both uniprocessor and multiprocessor environments ref cite web url http www.freebsd.org releases 7.0R relnotes.html title FreeBSD 7.0 RELEASE Release Notes accessdate 23 June 2008 ref , as well as interactive response under heavy ... 02 author Jeff Roberson ref . The user may switch between the BSD scheduler and ULE using a kernel compile ... more details
will also be expecting more advanced features from a job scheduler, such as Real time scheduling based ... software. Main concepts There are many concepts that are central to almost every job scheduler implementation ... schedulers is managing the job queue for a cluster of computers. Typically, the scheduler will schedule ... Distributed computing List of job scheduler software Further reading Scott, M http nexus.realtimepublishers.com ... more details
wiktionary A task is part of a set of actions for completion, and may refer to Task analysis Task project management Task computing , in computing, a program execution context TASK party , a series of improvisational participatory art related events organized by artist Oliver Herring Task language instruction refers to a certain type of activity used in language instruct lakes The Tandem pore domain potassium channel TASK family of potassium ion channels See also Task force disambig fr T che io Tasko sv Task olika betydelser ... more details
refimprove date February 2011 O n scheduler ref http www.ibm.com developerworks linux library l completely fair scheduler Linux scheduler history overview at ibm.com ref was scheduler, used in Linux kernel since the version 2.4. Since the version 2.6 it is replaced by O 1 scheduler and later by Completely Fair Scheduler CFS . Algorithm This scheduler divides processor time into epochs. Within each epoch, every task can execute up to its time slice. If a task does not use all of its time slice, then the scheduler adds half of the remaining time slice to allow it to execute longer in the next epoch. Advantages This scheduler was an advantage in comparison to the previously used very simple scheduler based on a circular queue. Disadvantages If the number of processes is big, the scheduler may use notable amount of the processor time itself. Picking the next task to run requires iteration through all currently planned tasks, so the scheduler runs O n time, where n is a number of the planned processes. References references Category Linux kernel Category Free software Category Scheduling algorithms ... more details
This is a list of notable job scheduling software . Job scheduler Job scheduling applications are designed to carry out repetitive tasks as defined in a schedule based upon calendar and event conditions. More recently this category of software is increasingly labeled as Workload Automation , which is an industry term for the next generation of job scheduling applications. There are three groups of job schedulers, those used by large organisations which have evolved from the early batch schedulers, the newer job schedulers just emerging onto the market and the non vendor schedulers. Large enterprise schedulers Stonebranch http www.opswise.com index.html OpsWise Automation Center Workload Automation 100 web based, completely cross platform BMC Software BMC Control M IBM TWS Available in two types ZMF the mainframe based scheduler and distributed formerly known as Maestro CA, Inc. CA 7, a mainframe scheduler from CA Technologies CA, Inc. CA ESP Workload Automation Computer Associates CA AutoSys Redwood Software Redwood Cronacle Sun Grid Engine Sun Grid Engine SGE ORSYP S.A ORSYP Dollar Universe Small enterprise schedulers Global ECS Vinzant Software BatchMan HONICO MVP Software JAMS Scheduler Non vendor schedulers Portable Batch System OpenPBS ProActive ProActive Parallel Suite , an Open Source computer software job scheduler developed by INRIA and ActiveEon Simple Linux Utility for Resource Management Open Source Job Scheduler Cron Unix built in scheduler Windows TaskScheduler Windows built in scheduler Category Job scheduling ... more details
computers with fewer than 16 CPU cores . Shortly following its introduction, the new scheduler made ... magazine.com Online News Ingo Molnar Tests New BF Scheduler Linux Magazine Review of BFS ref ref http www.linuxpromagazine.com Online News Con Kolivas Introduces New BFS Scheduler Linux Pro Magazine ... CyanogenMod 5 for the G1 ADP1 ref Desktop Linux distributions BFS is the default scheduler for Zenwalk ... Reflist Category Scheduling algorithms de Brain Fuck Scheduler pl Brain Fuck Scheduler ru Brain Fuck Scheduler ... more details
Adaptive Partition Schedulers are a relatively new type of partition scheduler, pioneered with the most recent version of the QNX operating system. Adaptive Partitioning, or AP, allows the real time system designer to request that a percentage of processing resources be reserved for a particular partition group of threads and or processes making up a subsystem . The operating system s priority driven pre emptive scheduler will behave in the same way that a non AP system would until the system is overloaded i.e. system wide there is more computation to perform than the processor is capable of sustaining over the long term . During overload, the AP scheduler enforces hard limits on total run time for the subsystems within a partition, as dictated by the allocated percentage of processor bandwidth for the particular partition. If the system is not overloaded, a partition that is allocated for example 10 of the processor bandwidth, can, in fact, use more than 10 , as it will borrow from the spare budget of other partitions but will be required to pay it back later . This is very useful for the non real time subsystems that experience variable load, since these subsystems can make use of spare budget from hard real time partitions in order to make more forward progress than they would in a Fixed Partition Scheduler such as http www.ghs.com products safety critical arinc653.html ARINC 653 , but without impacting the hard real time subsystems deadlines. QNX 6.3.2 and 6.4.X have this feature. External links http community.qnx.com sf wiki do viewPage projects.core os wiki Adaptive Partitioning Scheduler Adaptive Partitioning Scheduler page at QNX.com http www.kalinskyassociates.com Wpaper3.html A Survey of Task Schedulers for an overview of schedulers, including partition schedulers. Category Unix unix stub ... more details
The Completely Fair Scheduler is the name of a scheduling computing taskscheduler which was merged into the 2.6.23 ... O 1 scheduler , crediting Kolivas in his announcement. ref cite mailing list last Moln r first Ingo authorlink Ingo Moln r title & x5b patch& x5d Modular Scheduler Core and Completely Fair Scheduler ... to the previous O 1 scheduler used in older Linux 2.6 kernels, the CFS scheduler implementation is not based on run queue s. Instead, a red black tree implements a timeline of future task execution. Additionally, the scheduler uses nanosecond granularity accounting, the atomic units by which ... 2007 04 18 url http kerneltrap.org node 8059 title Linux The Completely Fair Scheduler publisher KernelTrap ref Like the old O 1 scheduler, CFS uses a concept called sleeper fairness , which considers ... completely fair scheduler CFS description at ibm.com ref , the scheduler stores the records about the planned .... The new leftmost node is then picked from the tree, repeating the iteration. If the task spends ... the name fair clock in Linux s implementation. The fair queuing CFS scheduler has a scheduling complexity of O Logarithm log N , where N is the number of tasks in the runqueue. Choosing a task can be done in constant time, but reinserting a task after it has run requires O log N operations, because ... process scheduler widely used in a general purpose operating system. ref name dwrr http happyli.org ... Round Robin ref Fairer algorithms Technically, the name Completely Fair Scheduler is not entirely ... the scheduler fairer for use on desktops and workstations. Developed by Mike Galbraith using ideas suggested ... 90 style background color EEEEEE blockquote div style font size 90 p Each task s signal struct contains an inherited pointer to a refcounted autogroup struct containing a task group pointer, the default for all tasks pointing to the init task group. When a task calls proc set tty , the process wide reference to the default group is dropped, a new task group is created, and the process is moved ... more details
Infobox Software name Open Source Job Scheduler logo Image Job scheduler log wiki.jpg 200px screenshot caption author developer Software und Organisations Service GmbH released latest release version 1.3.7 latest release date release date and age 2010 04 23 latest preview version latest preview date ... or closed source licence ref name license cite web url http jobscheduler.sourceforge.net osource scheduler licence en.htm publisher Job Scheduler title Licencing Models accessdate 2007 09 16 ref website http jobscheduler.sourceforge.net The Open Source Job Scheduler is an open source computer application for enterprise level job scheduling used for process automation . Job Scheduler is used to launch ... SOA architectures BPEL Mode of Operation Used for batch scheduling , the Job Scheduler runs as Daemon ... Scheduler can be controlled by the built in web server s graphical user interface. The Job Scheduler ... Scheduler API . Jobs can be executed independently from one another. Depending on the execution result ... Task computers tasks . Job chains can be seen as an assembly line on which multiple job nodes are passed ... can start jobs or otherwise control the Job Scheduler via API API s . Key Features The Job Scheduler is delivered with a range of standard features, e.g. Job activities can be limited to timeslots. The Job Scheduler supports any number of timeslots, which can be configured according to individual job requirements. The Job Scheduler allows the assignment of job priorities. Job history protocols ... Computer cluster High availability Cluster A Job Scheduler backup cluster ensures fail safe operation with automatic fail over. A fail safe system consists of a primary Job Scheduler and at least ... Secure Copy and SFTP Secure file transfer. Implementation The Job Scheduler is written in C . Standard ... Scheduler is customized according to specific business requirements. Enterprise level support is available ... Job scheduling Category 2005 introductions de Open Source Job Scheduler ... more details
Context date October 2009 An O 1 scheduler is a Kernel computer science kernel Scheduling computing scheduling design that can schedule Process computing processes within a constant amount of time, regardless of how many processes are running on the operating system . One of the major goals of operating system designers is to minimize Computational overhead overhead and jitter of OS services, so that application programmers who use them endure less of a performance impact. In Linux , it has replaced the previously used O n scheduler . An O 1 scheduler provides constant time scheduling services, thus reducing the amount of jitter normally incurred by the invocation of the scheduler. In the realm of real time operating system s, deterministic execution is key, and an O 1 scheduler is able to provide scheduling services with a fixed upper bound on execution times. In versions of Linux kernel 2.6 prior to 2.6.23, the scheduler used is an O 1 scheduler by Ingo Moln r . The scheduler used thereafter is the Completely Fair Scheduler , also by Ingo Moln r, which runs in O log N time. Meaning of O 1 O 1 does not mean the scheduler is necessarily extremely fast. Big O notation does not make any statements about speed or execution time. As stated above, O 1 simply means that no matter how many tasks there are in the system, scheduling them takes at most some constant amount of time, however many tasks there might be. This constant amount of time potentially needed may be considered slow ... Big O notation Completely Fair Scheduler Linux kernel Ingo Moln r External links http joshaas.net linux Understanding the Linux 2.6.8.1 CPU Scheduler Josh Aas, 17 February 2005 http www.ittc.ku.edu hybridthreads HybridThreads Hthreads A HW SW co designed POSIX compatible OS featuring a O 1 scheduler implemented in hardware http www 128.ibm.com developerworks linux library l scheduler Inside the Linux scheduler Written by M. Tim Jones, an IBM developerWorks article Category Scheduling algorithms ... more details
Multimedia Class Scheduler Service MMCSS is a Windows service that boosts the CPU as well as Windows Vista I O technologies I O subsystem I O priority of a thread. It allows an application to get prioritized access to CPU for time sensitive processing such as multimedia applications as well as prioritized disc access to ensure that the process is not starved of data to process. The MMCSS service monitors the CPU load and dynamically adjusts priority so that the application can use as much CPU time as possible without denying CPU to lower priority applications. ref name mmcss cite web url http msdn2.microsoft.com en us library ms684247.aspx title Multimedia Class Scheduler Service accessdate 2007 10 09 ref MMCSS uses heuristics to determine the relative priority required for the task the thread is performing and dynamically adjusts priority based on that. ref name mmcss A thread must invoke MMCSS explicitly to use its services by calling the code AvSetMmMaxThreadCharacteristics code ref cite web url http msdn2.microsoft.com en us library ms681973.aspx title AvSetMmMaxThreadCharacteristics Function Windows accessdate 2007 10 09 ref or code AvSetMmThreadCharacteristics code ref cite web url http msdn2.microsoft.com en us library ms681974.aspx title AvSetMmThreadCharacteristics Function Windows accessdate 2007 10 09 ref API s. MMCSS is used by the multimedia applications in Windows Vista , including Windows Media Player and Windows Media Center to provide glitch free audio playback. Problems This service has been implicated in poor networking performance while multimedia is playing. ref http blogs.zdnet.com hardware ?p 724 Microsoft responds to Vista network performance issue ref , ref http blogs.technet.com markrussinovich archive 2007 08 27 1833290.aspx Sysinternals blog Vista Multimedia Playback and Network Throughput ref In response to this, Microsoft has included a configurable option ref http support.microsoft.com kb 948066 Microsoft Knowledge base article 948066 ref ... more details
Quartz Scheduler is an open source job scheduling service released under the Apache License Apache 2.0 License . Uncategorized stub date April 2011 free software stub ... more details
Maui Cluster Scheduler was an open source job scheduler for use on computer cluster clusters and supercomputer s. Maui is capable of supporting multiple scheduling policies, dynamic priorities, reservations, and fairshare capabilities. It improves the manageability and efficiency of machines ranging from clusters of a few processors to multi teraflops supercomputers. Development and support Maui was developed during the mid 90s and abandoned in 2005. It was made possible by the support of Cluster Resources, Inc. and the contributions of many individuals and sites including the U.S. Department of Energy , Pacific Northwest National Laboratory PNNL , the Center for High Performance Computing at the University of Utah CHPC , Ohio Supercomputer Center OSC , University of Southern California USC , San Diego Supercomputer Center SDSC , MHPCC, BYU , NCSA , and many others. It may be downloaded, modified and redistributed. Maui Cluster Scheduler was maintained and supported by Cluster Resources, Inc. , but is now a commercial product which they call Moab Cluster Suite . The 2005 version source code is still available on Sourceforge http sourceforge.net projects mauischeduler files . External links Portal Free software http www.clusterresources.com products maui cluster scheduler.php Maui Cluster Scheduler official page http www.clusterresources.com products moab cluster suite.php Moab Cluster Suite http mauischeduler.sourceforge.net Maui Scheduler Molokini Edition followup version at SourceForge.net Sourceforge Category Job scheduling Category Free system software ru Maui ... more details
software stub The Supervisor Monitoring Scheduler or SMS is a job scheduler infrastructure for Linux based systems, currently licensed and maintained by the European Centre for Medium Range Weather Forecasts ECMWF . It is used to submit batch jobs to different hosts through for example ssh . Server host interaction is assured through Remote Procedure Call RPC calls. SMS is used regularly by ECMWF member states for operational work controlling job queues for numerical weather forecast runs . It uses a Command Line Interface CLI prompt CDP to define job hierarchies from definition files, and when a job suite is defined, it can be controlled and monitored through an Motif widget toolkit X motif Graphical User Interface GUI interface called Xcdp. References http www.ecmwf.int products data software sms.html SMS homepage European Centre for Medium Range Weather Forecasts ECMWF . Category Job scheduling ... more details
Wikify date April 2010 Orphan date November 2006 Task computing is a computation to fill the gap between tasks what user wants to be done , and services functionalities that are available to the user . Task computing seeks to redefine how users interact with and use computing environments. It is built on pervasive computing . Task Computing Framework TCF and Task Computing Environment TCE A Task Computing Framework TCF is a framework that supports Task Computing, by providing support for The workflows of Task Computing, i.e., at a minimum, Discovery, followed by Composition and Execution Semantic description of tasks and services Specification, Execution and Re Usability of tasks by end users Manipulation including creation and disposal of services by the end users This definition of a Task Computing Framework does not make reference to computational components. Here an embodiment of a Task Computing Framework will be referred to as a Task Computing Environment TCE . A TCE is a computational system that includes, at a minimum, the following components One or more Task Computing Clients TCCs , One or more Semantically Described Services SDSs , One or more Semantic Service Discovery Mechanisms SSDMs , and Optionally one or more Service Controls SCs Applications Using Task Execution EditoR STEER ref http www.flacp.fujitsulabs.com rmasuoka papers Task Computing ISWC2003 202 color final.pdf Microsoft Word Task Computing ISCW2003 202 final.doc Bot generated title ref , embodiments of multiple Semantically Described Services and Service Controls the following applications are possible Exchanging Business Cards Showing and Sharing the Presentation Scheduling a Future Presentation Checking and Printing Directions to the Airport Notes references References Cite journal ref harv first Seng W. last Loke authorlink coauthors title Building Taskable Spaces over Ubiquitous Services journal IEEE Pervasive Computing volume 8 number 4 pages 72 78 year 2009 Related work http csdl2.computer.org ... more details
more footnotes date January 2011 Task analysis is the analysis of how a task is accomplished, including a detailed description of both manual and mental activities, task and element durations, task frequency, task allocation, task complexity, environmental conditions, necessary clothing and equipment, and any other unique factors involved in or required for one or more people to perform a given task. Task analysis emerged from research in applied behavior analysis and still has considerable research in that area. Information from a task analysis can then be used for many purposes, such as personnel ... of checklist s or decision support systems and automation . Applications of task analysis The term task is often used interchangeably with activity or wikt process process . Task analysis often results in a hierarchical representation of what steps it takes to perform a task for which there is a goal and for which there is some lowest level action that is performed. Task analysis is often performed by human factors professionals. Task analysis may be of manual tasks, such as bricklaying, and be analyzed as time and motion studies using concepts from industrial engineering . Cognitive task analysis ... , and response planning and execution. Task analysis is also used in education . It is a model that is applied ... of students with learning disabilities and which task modification might be necessary. It discovers ... into steps. This often serves as the basis for chaining . Task analysis versus work domain analysis If task analysis is likened to a set of instructions on how to navigate from Point A to Point B, then work ... ecological psychology and ecological interface design . Task analysis and documentation Since ... on usability and user centered design rather than system software product design. This task orientation ... on task analysis. Its three basic information types are Task, Concept, and Reference. Tasks are analyzed ... s guide to cognitive task analysis publisher MIT Press cite book author Kirwan, B. and Ainsworth ... more details
Encyclopedia
top
