Abstract: In one aspect, a method of generating a computer-based dialog process includes receiving, in a computer system, a process type for creating a process. The process type includes (i) step elements each corresponding to a user-interaction task in the process, and (ii) step groups each including one or more of the step elements, wherein the process type defines an order of the step groups. The method includes receiving executable code for the process in a configuration-time context. The executable code (i) specifies that each of the step groups is performed in one or more steps, thereby defining a granularity of the process, and (ii) assigns at least one of the step elements in each step group to each of the one or more steps, thereby defining an order of the step elements in each step group. The method includes generating a runtime implementation of the process using the executable code.

Abstract: Arrangements and methods for employing empirical evidence to estimate the performance of applications with very few data samples, in complex environments such as dynamic SDP environments, using one or more effective data-plotting models.

Abstract: A computer-readable medium includes instructions that, when executed by a processor, cause the processor to receive an installation request from a remote device through a communication channel to update a software component associated with the processor. The processor identifies a capability library component that will be used to perform at least a portion of the installation request and retrieves and uses the capability library component from a local data store to perform the portion of the installation request if the local data store includes the capability library component. The processor requests the capability library component from the remote device if the local data store does not include the capability library component.

Abstract: To restrain the amount of information to be saved to the minimum necessary and suppress temporal overhead required for save and return when task switching associated with a priority processing request occurs in a signal processing device for performing multitasking on stream data such as image signals, the signal processing device includes a pointer indicating position information of data in stream data according to progress of processing by a signal processing unit. When priority task processing is requested, the signal processing device saves only a pointer value. At the time of return, based on the saved pointer value the signal processing device obtains position information of output stream data to be outputted next in a returned task, obtains position information, in an input stream, of head input data of all input data that needs to be inputted to the signal processing unit to calculate the data, and resumes the processing.

Abstract: A data processing method executed by a first data processing apparatus and includes acquiring process information concerning a first process, in response to a process request for the first process; setting a first process flag included in the process information concerning the first process to indicate “true”; setting a first end flag of the process information concerning the first process to indicate “true” after executing the first process; acquiring process information concerning a second process that is to be executed before a third process that is to be executed subsequent the first process; and determining a process to be executed, based on a second process flag and a second end flag included in the process information concerning the second process.

Abstract: Techniques for thread mapping in multi-core processors are disclosed. An example computing system is disclosed having a multi-core processor with a plurality of processor cores. A performance counter may be configured to collect data relating to the performance of the multi-core processor. A core controller may be configured to map threads of execution to the processor cores based at least in part on the data collected by the performance counter.

Abstract: Architecture for offering enticements to cellular customers that will lead the customers to use the available services at times away from peak usage. For example, the provider can offer incentives (or enticements) that direct users to make phone calls during off-peak times of the hour or day. An incentive can include charging customers reduced minutes (e.g., 0.75 minutes) for each minute used from the customer plan when the customer uses services during off-peak time of the day. This applies to text messaging where users can attach files such as images and short video clips for communication to other cellular users, and to cellular devices via which users can access websites. In general, any services supported by the wireless provider can benefit by providing incentives to move users away from times of high network usage during the day.

Abstract: Embodiments of a data handling apparatus is adapted to facilitate resource allocation, allocating resources upon which objects execute. Embodiments of a data handling apparatus can include resource allocation logic and a scheduler. The resource allocation logic can be operable to dynamically set entitlement values for a plurality of resources comprising physical/logical and operational resources. The entitlement values are specified as predetermined rights wherein a process of a plurality of processes is entitled to a predetermined percentage of operational resources. The scheduler can be operable to monitor the entitlement values and schedule the processes based on priority of the entitlement values.

Abstract: Methods, apparatus, and fabrication processes relating to thermal calculations of an integrated circuit device are reported. The methods may comprise determining a power consumption by a power entity of an integrated circuit, the power entity comprising at least one functional element of the integrated circuit; determining a temperature of a thermal entity, the thermal entity comprising a subset of the power entity; and adjusting at least one of a voltage or an operating frequency of at least one functional element of the power entity, based upon the temperature of the thermal entity being greater than or equal to a predetermined threshold temperature for the thermal entity.

Abstract: An enterprise data warehouse or business intelligence system having a plurality of processors and memory resources. The system includes at least a database server, a workload management system, a query compiler, and a query executor. The database server configured to receive a database query from an application at a database client system. The query compiler configured to prepare the execution plan for the query and compute the number of executive server processes (ESPs) in each ESP layer of the query. The workload management system is configured to generate an affinity value, and the query executor is configured to execute the query. As disclosed herein, placement of the executive server process layers of the query onto processors of the computing system is determined using the affinity value. Other embodiments, aspects and features are also disclosed.

Abstract: Embodiments of thread binding are provided. An aspect includes generating a thread layout for an application. Another aspect includes determining a task count for the application; determining a task rank for each task of the task count; determining a thread count for each task associated with the application, wherein a thread count for a first task associated with the application is unequal to a thread count of a second task associated with the application; and indicating one or more preferred processors of a plurality of processors for each task associated with the application. Another aspect includes allocating system for each of the tasks of the application based on the thread layout. Another aspect includes affinitizing the tasks by generating child threads for each of the tasks, wherein a number of threads generated for each task corresponds to the thread count for the task in the thread layout.

Abstract: Described embodiments provide for dynamically controlling a scheduling rate of each node in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A traffic manager enqueues received tasks in a queue of the scheduling hierarchy associated with a data flow. The queue has a parent scheduler at each level of the hierarchy up to the root scheduler. The traffic manager maintains one or more scheduling data structures for each node in the scheduling hierarchy. If the traffic manager receives a rate reduction request corresponding to a given node of the scheduling hierarchy, the traffic manager updates one or more indicators in the scheduling data structure corresponding to the given node and removes the given node from the scheduling hierarchy, thereby reducing the scheduling rate of the node.

Abstract: Embodiments of thread binding are provided. An aspect includes generating a thread layout for an application. Another aspect includes determining a task count for the application; determining a task rank for each task of the task count; determining a thread count for each task associated with the application, wherein a thread count for a first task associated with the application is unequal to a thread count of a second task associated with the application; and indicating one or more preferred processors of a plurality of processors for each task associated with the application. Another aspect includes allocating system for each of the tasks of the application based on the thread layout. Another aspect includes affinitizing the tasks by generating child threads for each of the tasks, wherein a number of threads generated for each task corresponds to the thread count for the task in the thread layout.

Abstract: A method is disclosed to manage a multi-processor system with one or more manycore devices, by managing real-time bag-of-tasks applications for a cluster, wherein each task runs on a single server node, and uses the offload programming model, and wherein each task has a deadline and three specific resource requirements: total processing time, a certain number of manycore devices and peak memory on each device; when a new task arrives, querying each node scheduler to determine which node can best accept the task and each node scheduler responds with an estimated completion time and a confidence level, wherein the node schedulers use an urgency-based heuristic to schedule each task and its offloads; responding to an accept/reject query phase, wherein the cluster scheduler send the task requirements to each node and queries if the node can accept the task with an estimated completion time and confidence level; and scheduling tasks and offloads using a aging and urgency-based heuristic, wherein the aging guarante

Abstract: Computer user working environment has been evolved from punch card & paper tape to mouse click native window based in past few decades. This invention takes the course of this continuing evolution and creating a web based computer user work environment for a control management station and its associated systems on the network crossing Intranet, Internet or LAN. Therefore, users can access and manage the control management station and all its associated system through web browser on any other systems or devices. To establish a web based computer user work environment, the resources information on control management station and on associated systems on network need to be collected and convert them to standard structured format for web based communication and further displaying them in web browser. These information need to be collected by control management station at its and the associated systems' boot up time or at the time when user login and request to access and manage these resources.

Abstract: Arrangements and methods for employing empirical evidence to estimate the performance of applications with very few data samples, in complex environments such as dynamic SDP environments, using one or more effective, data-plotting models.

Abstract: A computer-implemented method for recovering an application is described. A priority level is assigned to a process that interacts with the application. A state of the application is monitored. A determination is made that the state of the application is unstable. A first process that is assigned a first priority level is disabled. A determination is made as to whether the state of the application remains unstable.

Abstract: A processor comprises a plurality of processing units operating in parallel. Each processing unit is associated with a time signal generator upon the expiry of which the corresponding processing unit is capable to set expired time signal generator to a predefined duration of time. In case an end of the predefined duration of time deviates less than a predefined duration of time from a scheduled expiry of a time signal generator assigned to a different processing unit; predefined duration of time is modified.

Abstract: In a multi-tasking pipelined processor, consecutive instructions are executed by different tasks, eliminating the need to purge an instruction execution pipeline of subsequent instructions when a previous instruction cannot be completed. The tasks do not share registers which store task-specific values, thus eliminating the need to save or load registers when a new task is scheduled for execution. If an instruction accesses an unavailable resource, the instruction becomes suspended, allowing other tasks' instructions to be executed instead until the resource becomes available. Task scheduling is performed by hardware; no operating system is needed. Simple techniques are provided to synchronize shared resource access between different tasks.

Abstract: A system and method for predicting the likelihood of failure of the individual sectors of a magnetic storage disk based upon the monitoring of adjacent sector performance in responding to access requests. The prediction for a specific target sector's fidelity can be made through the gathering of sector performance data that occurs during normal read/write actions to the adjacent sectors, without a recent access request necessarily being made to the target sector. Scrubbing of the sectors can also be directed based upon the needed sector access data for target sector fidelity prediction.

Abstract: A scalable job scheduler for a multi-thread, multi-processor system synchronizes and schedules jobs for execution by using lists and jobs counters for the numbers of active jobs. It minimizes synchronization overhead by using atomic operations for incrementing and decrementing the counters. The scheduler assigns jobs for execution, and can awake up an available thread to pick up work. A parent job spawns child jobs and maintains a job counter. Spawned jobs are added to the list for execution and the counter of waiting jobs is incremented. When execution of a job begins, the parent's counter of outstanding child jobs is decremented. A parent job is suspended until its counter of uncompleted spawned child jobs reaches zero. As a job is completed, the scheduler decrements the counter of active jobs, and assigns the next job in the queue to an available thread.

Abstract: An embodiment or embodiments of an information handling apparatus are adapted to facilitate resource allocation using an entitlement vector comprising multiple fields that are respectively directed to multiple different resources or capabilities. In illustrative embodiments, an information handling apparatus can comprise an entitlement vector configured with a plurality of bit fields at least partly corresponding to a plurality of resources and operable to specify the resources used by at least one object of a plurality of a plurality of objects. The information handling apparatus can further comprise logic operable to allocate the resources to the at least one object based on entitlement as specified by the entitlement vector.

Abstract: A multi-thread processor includes a plurality of hardware threads each of which generates an independent instruction flow, a first thread scheduler that outputs a first thread selection signal, the first thread selection signal designating a hardware thread to be executed in a next execution cycle among the plurality of hardware threads according to a priority rank, the priority rank being established in advance for each of the plurality of hardware threads, a first selector that selects one of the plurality of hardware threads according to the first thread selection signal and outputs an instruction generated by the selected hardware thread, and an execution pipeline that executes an instruction output from the first selector. Whenever the hardware thread is executed in the execution pipeline, the first scheduler updates the priority rank for the executed hardware thread and outputs the first thread selection signal in accordance with the updated priority rank.

Abstract: According to one embodiment, in response to a connection request from a second virtual machine corresponding to a second client terminal on which a first user has newly executed a logon operation, an information processing apparatus determines whether a first user profile associated with a first identifier of the first user is being used by another client terminal. If the first user profile is being used, the apparatus causes a first virtual machine corresponding to the another client terminal to unmount the first storage location, and transmits the information indicative of the path to the first storage location to a second virtual machine corresponding to the second client terminal.

Abstract: A method of operation of a disk storage system includes: providing a disk storage controller; coupling a first physical disk to the disk storage controller; detecting a failure of the first physical disk; and rebuilding a first logical drive, after replacing the first physical disk, includes: selecting a selected stripe of the first logical drive, reading a selected stripe status of the selected stripe, and marking the selected stripe as on-line in the selected stripe status.

Abstract: Processing batch database workload while avoiding overload. A method for efficiently processing a database workload in a computer system comprises receiving the workload, which comprises a batch of queries directed toward the database. Each query within the batch of queries is assigned a priority. Resources of the computer system are assigned in accordance with the priority. The batch of queries is executed in unison within the computer system in accordance with the priority of each query thereby resolving a conflict within the batch of queries for the resources of the computer system, hence efficiently processing the database workload and avoiding overload of the computer system.

Abstract: A scheduler for a compute cluster that allocates computing resources to jobs to achieve a balanced distribution. The balanced distribution maximizes the number of executing jobs to provide fast response times for all jobs by, to the extent possible, assigning a designated minimum for each job. If necessary to achieve this minimum distribution, resources in excess of a minimum previously allocated to a job may be de-allocated, if those resources can be used to meet the minimum requirements of other jobs. Resources above those used to meet the minimum requirements of executing jobs are allocated based on a computed desired allocation, which may be developed based on respective job priorities. To meet the desired allocation, resources may be de-allocated from jobs having more than their desired allocation and re-allocated to jobs having less than their desired allocation of resources.

Abstract: According to an embodiment of the present invention, a system assigns at least one workload a hard share quantity and at least one other workload a soft share quantity or a hard share quantity. The system allocates a resource to the workloads based on the hard share quantity and the soft share quantity of active workloads in a predefined interval. A hard share quantity indicates a maximum resource allocation and a soft share quantity enables allocation of additional available processor time. Embodiments of the present invention further include a method and computer program product for allocating a resource to workloads in substantially the same manner as described above.

Abstract: A method of scheduling a plurality of tasks for a plurality of memories in a memory system is disclosed. The method includes classifying each task among the plurality of tasks to a task type among a plurality of task types, disposing a plurality of task queues according to the plurality of task types wherein each task queue stores tasks to be executed within the plurality of tasks, assigning a priority for each task type among the plurality of task types, disposing at least one execution queue; and converting a first task stored in a first task queue among the plurality of task queues into at least one command to be stored in a first execution queue among the at least one execution queue, wherein the at least one command is executed according to the priority of a first task type corresponding to the first task queue.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: Systems and methods for software automation are provided. Software testcases are distributed across multiple data processing systems (equivalently, “machines” or “hosts”) that may collectively include multiple platforms (equivalently, “operating systems”). A testcase may be executed as one or more processes progressing through a sequence of phases, with execution within a phase being asynchronous among processes. Synchronization of the testcase processes across the data processing systems and platforms may be effected by managing an event; the testcase processes block on the event upon completion of the current testcase phase. A testcase phase execution service on each host handles synchronization events. The definition of the testcase may include metadata that identifies the particular phases in sequence, that is phase names, for the testcase; the phase names identifies the phases to the synchronization process that triggers the synchronization events which initiate each succeeding phase of the testcase.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: A method, non-transitory computer readable medium, and apparatus for configuring a scheduling a job request in a data processing platform are disclosed. The method receives a new job request having a priority selected by a user, submits the new job request to an online job queue comprising a plurality of jobs, wherein each one of the plurality of jobs comprises a respective priority selected by a respective user and schedules the new job request and the plurality of jobs in the online job queue to one or more available worker nodes in a unit time slot based upon a comparison of the priority of the new job and the respective priority of the plurality of jobs in the online job queue, wherein the scheduling algorithm is based on one of: blocks having a variable size and a static processing time or blocks having a static size and a variable processing time.

Abstract: A shuffler receives information associated with partition segments of map task outputs and a pipeline policy for a job running on a computing device. The shuffler transmits to an operating system of the computing device a request to lock partition segments of the map task outputs and transmits an advisement to keep or load partition segments of map task outputs in the memory of the computing device. The shuffler creates a pipeline based on the pipeline policy, wherein the pipeline includes partition segments locked in the memory and partition segments advised to keep or load in the memory, of the computing device for the job, and the shuffler selects the partition segments locked in the memory, followed by partition segments advised to keep or load in the memory, as a preferential order of partition segments to shuffle.

Abstract: A shuffler receives information associated with partition segments of map task outputs and a pipeline policy for a job running on a computing device. The shuffler transmits to an operating system of the computing device a request to lock partition segments of the map task outputs and transmits an advisement to keep or load partition segments of map task outputs in the memory of the computing device. The shuffler creates a pipeline based on the pipeline policy, wherein the pipeline includes partition segments locked in the memory and partition segments advised to keep or load in the memory, of the computing device for the job, and the shuffler selects the partition segments locked in the memory, followed by partition segments advised to keep or load in the memory, as a preferential order of partition segments to shuffle.

Abstract: A video player instance may be prioritized and decoding and rendering resources may be assigned to the video player instance accordingly. A video player instance may request use of a resource combination. Based on a determined priority a resource combination may be assigned to the video player instance. A resource combination may be reassigned to another video player instance upon detection that the previously assigned resource combination is no longer actively in use.

Abstract: There is provided an information processing apparatus including a receiver configured to receive a request to perform processing related to a task, from a first information processing apparatus which functions as a client on a network; a scheduler configured to, when a rank of a priority of the scheduler of the information processing apparatus among information processing apparatuses on the network is a first predetermined rank or higher, assign the task to one or a plurality of second information processing apparatuses which function as nodes on the network; and a transmitter configured to transmit a request to execute processing related to the task assigned to the one or the plurality of second information processing apparatuses.

Abstract: Provided are a multi-thread processing apparatus and method for sequentially processing threads. The multi-thread processing method includes scheduling, at a processor, one of a plurality of thread groups allocated by a job distributor, determining whether the thread group has been initialized based on an examination an uninitialized flag of the scheduled thread group, generating a thread group descriptor for the scheduled thread group and initializing the thread group based on the determination of whether the thread group has been initialized, and initializing a thread descriptor based on a determination of whether initialization is needed and sequentially executing each thread in the scheduled thread group.

Abstract: In one embodiment, the invention provides a method of managing a computing job based on a job priority and a submitter quota.

Abstract: A system and method for detecting, filtering, prioritizing and reporting shared memory hazards are disclosed. The method includes, for a unit of hardware operating on a block of threads, mapping a plurality of shared memory locations assigned to the unit to a tracking table. The tracking table comprises initialization information for each shared memory location. The method also includes, for an instruction of a program within a barrier region, identifying a potential conflict by identifying a second access to a location in shared memory within a block of threads executed by the hardware unit. First information associated with a first access and second information associated with the second access to the location is determined. Filter criteria is applied to the first and second information to determine whether the instruction causes a reportable hazard. The instruction is reported when it causes the reportable hazard.

Abstract: A time and space-deterministic task scheduling apparatus and method using a multi-dimensional scheme are disclosed. The time and space-deterministic task scheduling apparatus includes a preparation list generation unit and a task insertion unit. The preparation list generation unit generates a preparation list, including a preparation table having an array structure configured to have each bit formed of a binary number indicative of a priority of a task, and also including a preparation group cluster configured to include a plurality of preparation groups, each including bits corresponding to the respective binary numbers of the preparation table, and to have an upper and lower dimension relationship between the plurality of preparation groups. The task insertion unit performs bit masking on the preparation group cluster and the preparation table corresponding to a task P having a specific priority and thus inserts the task into the preparation group cluster and the preparation table.

Abstract: A method for scheduling tasks from a program executed by a multi-processor core system is disclosed. The method includes a scheduler that groups a plurality of tasks, each having an assigned priority, by priority in a task group. The task group is assembled with other task groups having identical priorities in a task group queue. A hierarchy of task group queues is established based on priority levels of the assigned tasks. Task groups are assigned to one of a plurality of worker threads based on the hierarchy of task group queues. Each of the worker threads is associated with a processor in the multi-processor system. The tasks of the task groups are executed via the worker threads according to the order in the hierarchy.

Abstract: Techniques are described for managing distributed execution of programs, including by dynamically scaling a cluster of multiple computing nodes performing ongoing distributed execution of a program, such as to increase and/or decrease computing node quantity. An architecture may be used that has core nodes that each participate in a distributed storage system for the distributed program execution, and that has one or more other auxiliary nodes that do not participate in the distributed storage system. Furthermore, as part of performing the dynamic scaling of a cluster, computing nodes that are only temporarily available may be selected and used, such as computing nodes that might be removed from the cluster during the ongoing program execution to be put to other uses and that may also be available for a different fee (e.g., a lower fee) than other computing nodes that are available throughout the ongoing use of the cluster.

Abstract: A computer system is provided with a processing chip having one or more processor cores, with the processing chip in communication with an operating system having kernel space and user space. Each processor core has multiple core threads to share resources of the core, with each thread managed by the operating system to function as an independent logical processor within the core. A logical extended map of the processor core is created and supported, with the map including each of the core threads indicating usage of the operating system, including user space and kernel space, and cache, memory, and non-memory. An operating system scheduling manager is provided to schedule a routine on the processor core by allocating the routine to different core threads based upon thread availability as demonstrated in the map, and thread priority.

Abstract: A computing method includes accepting a definition of a computing task, which includes multiple Processing Elements (PEs) having execution dependencies. The computing task is compiled for concurrent execution on a multiprocessor device, by arranging the PEs in a series of two or more invocations of the multiprocessor device, including assigning the PEs to the invocations depending on the execution dependencies. The multiprocessor device is invoked to run software code that executes the series of the invocations, so as to produce a result of the computing task.

Abstract: Managing threads for executing on a computing device based on a power state of the computing device. A power priority value corresponding to each of the threads is compared to a threshold value associated with the power state. The threads having an assigned power priority value that violates the threshold value are suspended from executing, while the remaining threads are scheduled for execution. When the power state of the computing device changes, the threads are re-evaluated for suspension or execution. In an embodiment, the threads on a mobile computing device are managed to maintain the processor in a low power state to reduce power consumption.

Abstract: The subject disclosure is directed towards automatically managing job request execution for a computer cluster using cloud computing resource allocations. When client computers to the computer cluster submit job requests to a head node, a set of job requests is selected based on a policy. The head node converts the set of job requests into a set of resource allocation requests based on job specification data. After communicating the resource allocation requests to a cloud computing provider, the head node is granted access and control over one or more worker nodes as a response. The worker nodes proceed to execute the set of job requests and update the head node with status information once the execution finishes.

Abstract: A task scheduling method is applied to a heterogeneous multi-core system. The heterogeneous multi-core system has at least one first processor core and at least one second processor core. The task scheduling method includes: referring to task priorities of tasks of the heterogeneous processor cores to identify at least one first task of the tasks that belongs to a first priority task group, wherein each first task belonging to the first priority task group has a task priority not lower than task priorities of other tasks not belonging to the first priority task group; and dispatching at least one of the at least one first task to at least one run queue of at least one of the at least one first processor core.

Abstract: The present invention relates to a system for handling client/server traffic and communications pertaining to the delivery of hypertext information to a client. The system includes a central server which processes a request for a web page from a client. The central server is in communication with a number of processing/storage entities, such as an annotation means, a cache, and a number of servers which provide identification information. The system operates by receiving a request for a web page from a client. The cache is then examined to determine whether information for the requested web page is available. If such information is available, it is forwarded promptly to the client for display. Otherwise, the central server retrieves the relevant information for the requested web page from the pertinent server.

Abstract: Disclosed herein are representative embodiments of tools and techniques for displaying one or more task tracking controls to indicate respective progress statuses, urgency stages, and due dates for respective of one or more listed tasks of a procedure. According to one exemplary technique, a task list is received by a software. The task list including a listed task. In addition, a determination is made that the listed task is in an incomplete status. Also, an urgency stage is determined for the listed task. The listed task is associated with a due date for the listed task. Based on the determination that the listed task is in an incomplete status, a task tracking control is output for display. The task tracking control indicating the incomplete status of the listed task includes a visual indication of the due date and a visual indication of the urgency stage for the listed task.