Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

48 results about "Activity scheduling" patented technology

Activity Scheduling is a tool for combating passivity and gradually re-engaging the depressed person in some of the routines of his/her daily life. The first step in Activity Scheduling is simply to monitor the activity over the course of a week by recording on a grid (see below).

System for allocating resource using the weight that represents a limitation on number of allowance active sessions associated with each resource consumer group

InactiveUS7020878B1Increase and decrease system resourceMultiprogramming arrangementsMemory systemsMass storageActivity scheduling
One embodiment of the present invention provides a resource scheduler for allocating a computer system resource, such as memory or mass storage, within a processor, to database management system (DBMS) processes. The resource scheduler operates according to resource plans and resource allocation methods. One or more plans may be configured and loaded with the DBMS. Each plan allocates the resource according to an associated resource allocation method. During operation of the DBMS, any or all of the active plans and resource allocation methods may be exchanged for alternate plans or resource allocation methods. In one embodiment of the invention the resource scheduler enforces a maximum active sessions resource allocation method in which system resources are allocated by limiting the number of active sessions allowed in groups of database processes grouped according to common execution requirements. A selected plan includes multiple process groups and / or sub-plans. The resource scheduler allocates system resources among the sub-plans and groups of database processes according to their associated limits on active session numbers, with sub-plans and groups having higher active session limits getting access to more system resources than sub-plans and groups having lower active session limits.
Owner:ORACLE INT CORP

Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems

The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and / or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.
Owner:MICROSOFT TECH LICENSING LLC

Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems

The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.
Owner:MICROSOFT TECH LICENSING LLC

Calendar generator and calendar generating method

The presentation relates to a calendar generator, comprising: a column generator to generate description of columns, which columns comprise blank space units representing fixed term and are labeled with time lags as represented, wherein width of columns corresponds to length of term as represented; a periodical activity plan generator to record starting date and period for at least one periodical activity plan in order to generate description of a plurality of date and corresponding activity; a fixed date activity plan generator to record at least one date and content of activity for at least one activity plan; said fixed date activity plan generator being able to grab date and activity information of said periodical activity plan generated by said periodical activity plan generator; an activity recording means to generate records of activity, including description and dates of past activities, according to inputs of user; and a user interface to display columns and contents of said columns according to description generated by said column generator, said periodical activity plan generator, said fixed date activity generator and said activity recording means and to allow user to add, revise and/or delete a periodical activity plan, a fixed date activity plan or an activity record.
Owner:LU LI CHIN
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products