Showing papers on "Task (computing) published in 2001"

Method and system for network-distributed computing

Abstract: A distributed computing system achieves a highly distributed environment where very large computation intensive tasks are broken down into thousands of sub-tasks and then distributed to thousands of clients running on a variety of computers across the Internet. The idle CPU time of each of these thousands of client computers is used to perform these computations by running custom application modules in a low priority. A task server keeps track of information associated with each of the clients and uses the information to assign one or more tasks associated with a computing problem to each client computer. A file server provides the application modules to the client computers for executing their assigned tasks. An application server provides input data for the application modules and receives output data from the application modules. Status and performance information for machines, accounts and teams is collected by the task server and displayed on a background page of each client. Incentives for commitments of computing time are provided to users of potential client computers.

Updating data from a source computer to groups of destination computers

Abstract: A source computer 8 stores updated data that is to be distributed to a plurality of destination computers (12 to 30). The destination computers (12 to 30) are divided into groups sharing a common priority level (5, 4, 3, 2, 1). Each of these groups is then associated with a push update task to be executed by the source computer 8. These push update tasks are then sequentially executed. If a particular group of destination computers exceeds a threshold size, then it may be further divided in accordance with a hierarchy of splitting rules. The push update tasks use multicasting to transfer the update data to the destination computers within their groups in a manner that reduces network traffic.

Information processing apparatus and method

Abstract: An information processing apparatus and method consisting of the modules 1) peripheral control including power management resulting in increased battery life where a plurality of peripherals use a single power source to eliminate external power supplies, 2) universal conversion, an extensible system for taking any information as input and converting to any desired feasible output, 3) virtual user production, which creates a digital representation of a user through constant recording and analysis of completed work, which is disintegrated and stored in lists comprising tasks and related options. A list captures and represents the user's preferences. Dynamic and evolving lists define a virtual user capable of repeating any previously recorded task. A corresponding Web based communication provider automatically feeds additional tasks and options to the invention, which can grow substantially unassisted by the user.

A classification of tasks in bioinformatics

Abstract: Motivation: This paper reports on a survey of bioinformatics tasks currently undertaken by working biologists. The aim was to find the range of tasks that need to be supported and the components needed to do this in a general query system. This enabled a set of evaluation criteria to be used to assess both the biology and mechanical nature of general query systems. Results: A classification of the biological content of the tasks gathered offers a checklist for those tasks (and their specialisations) that should be offered in a general bioinformatics query system. This semantic analysis was contrasted with a syntactic analysis that revealed the small number of components required to describe all bioinformatics questions. Both the range of biological tasks and syntactic task components can be seen to provide a set of bioinformatics requirements for general query systems. These requirements were used to evaluate two bioinformatics query systems.

Method for loading software

Abstract: The invention relates to a method for loading software into a target device of a vehicle control system comprising a number of devices. The inventive method involves the following steps: subdividing the loading of a software module into partial tasks, namely into at least one control device task, one update device task and one receiving device task, and assigning an execution of the partial tasks to the target device, the devices and/or to a control station located outside of the vehicle control system. The control device task involves a processing and routing of control commands for loading the software module from outside of the vehicle control system. The update device task involves a control of the loading of the software module between the target device, the devices and/or the control station, and the receiving device task involves a provision of an interface for the software module to be loaded from outside the vehicle control system. The invention additionally relates to the use of this method, for example, in control systems of motor vehicles.

Hybrid machine/human computing arrangement

Abstract: A hybrid machine/human computing arrangement which advantageously involves humans to assist a computer to solve particular tasks, allowing the computer to solve the tasks more efficiently. In one embodiment, a computer system decomposes a task, such as, for example, image or speech comparison, into subtasks for human performance, and requests the performances. The computer system programmatically conveys the request to a central coordinating server of the hybrid machine/human computing arrangement, which in turn dispatches the subtasks to personal computers operated by the humans. The humans perform the subtasks and provide the results back to the server, which receives the responses, and generates a result for the task based at least in part on the results of the human performances.

Method and apparatus for high-performance sequence comparison

Abstract: A computer-implemented method and apparatus for performing remote sequence comparison. Multiple query sequences are searched against one or more sequence databases. The method includes partitioning the query sequences and partitioning the sequence databases into smaller subsets, assigning searching tasks to members of a group of computers working in parallel, each member further dividing a task into related tasks on a virtual memory shared memory bulletin board for providing high-performance and high-speed sequence comparison.

Display monitor for golf cart yardage and information system

Abstract: A player position determining and course management system for a golf course having a plurality of roving units for use by players in playing the course is disclosed. Each roving unit includes a central processing unit (CPU) including a data processor for executing various tasks ranging from fastest-execution of a task to slowest execution of a task on a schedule of priorities of task completion, a real-time means for controlling the processor to give the tasks priority ranging from fastest execution of a task with highest priority to slowest execution of a task with lowest priority, and a means for precisely timing functions of the system including modulating means utilizing a common digital modulation technique for digitally modulating data transmitted to and from all of the roving units. Each of the roving units include a monitor for displaying the golf course including each of the holes with its tee box, fairway, green, cup and hazards, as well as the position of the roving unit on the course in real time. Additionally, the system includes a course management base station for transmitting and receiving information to the roving units and a monitor for displaying the location of each roving unit on the golf course in real time.

Computer system having low energy consumption

Abstract: The energy consumption of a computing system is reduced by incorporating two or more processing units with diverse energy efficiencies and diverse processing capabilities. A scheduler intercepts an interrupt(s) from I/O space, resolves the interrupt to a task, retrieves energy and performance attributes for the task, and schedules the task for execution on the processing units such that the task will consume the least amount of energy while executing in a timely fashion.

Graphical programming system and method including nodes for programmatically accessing data sources and targets

Abstract: A system and method for creating a graphical program which accesses data from/to one or more of a data source or a data target. The present invention greatly simplifies the task of creating or configuring a graphical program to exchange data with a data source and/or data target. When a user is creating or configuring a graphical program, the user may cause various nodes or icons to be displayed on the display and may connect the various nodes or icons together. If the user desires the graphical program to access data from/to one or more of a data source or a data target, the user may cause to be displayed a data access node in the graphical program. The user may then configure the data access node with location information of one or more of a data source or a data target. For example, the user may provide a URL specifying a location of the data source or the data target. The computer system may then construct execution instructions in response to the graphical program, wherein the execution instructions are executable to access data from/to the one or more of the data source or the data target as indicated by the data access node. The execution instructions may then be executed, wherein the data access node accesses data from/to the one or more of the data source or the data target during execution.

Graphical system and method for defining pilot tasks, patterns and constraints

Abstract: Various embodiments of the invention suitably provide dialog boxes (400, 500, 600, 700, 800, 900) in response to pilot commands so that task parameters may be input or modified. Pilot tasks include 'direct-to', 'hold', 'procedure turn', 'cross with flyover', 'show info', 'orbit', 'radial', and the like. According to various embodiments, certain dialog boxes include graphical functionality (502) and incorporate 'human factors' enhancements such that information is efficiently presented in a manner that corresponds to air traffic control instructions.

Computer processing and programming method using autonomous data handlers

Abstract: A computer processing and programming method calls for creating a plurality of software entities (“molecules”) which can be dynamically configured to process data autonomously. The molecules can send and receive signals indicating the state of a molecule, whether or not a processing task is fulfilled, the results of a processing task, and whether or not the operation of a molecule is to be terminated, interrupted, reconfigured, or continued by creation of one or more “next” molecules. The molecules are created from a common set of software micro-components, which may be programmed in any programming languages to run in any operating system environments. The molecules may reside with a single computing resource, however, they are ideally suited to be deployed with distributed computing resources of different types on a network or in a parallel processing environment. An overall data processing task is performed by creating molecules in a “logic web” which can dynamically adapt to fulfill the task. Logic webs can be assigned to operate with different legacy systems, with applications programmed in different languages, and with data of any type stored in any format. As a result, data processing tasks in distributed or parallel processing environments can be performed much more efficiently, and entirely new types of data processing tasks can be undertaken.

System and method for selectable semantic codec pairs for very low data-rate video transmission

Abstract: A system and method for using computer image processing for selectable task-based digital video compression is described. The system is intended to reduce travel of experts and let these experts direct field agents in performing tasks remotely. The tasks to be performed in the remote field can be monitoring, manipulating, and navigating. A field agent performs the manipulation and navigation operations, this agent can be a human being or a robot. The task-based compression algorithms use computer vision techniques to extract the bare minimum amount of information from the remote field scenery to allow the task to be performed. High frame rate photo-realistic reconstruction of the remote scene is not generally necessary.

Computer system and method for sharing a job with other computers on a computer network using IP multicast

Abstract: A computer system on a network uses IP multicast to recruit other computer systems to share in the processing of a job. If a computer system on the network wants to be available to process shared jobs, it first registers for job sharing by invoking an IP multicast router at a particular IP address. All messages sent to the IP multicast router are broadcast to all computer systems that are registered with the router. When a computer system has a job to share, it recruits other computer systems to help process the job by sending a message to the IP multicast router that corresponds to a request to share the job. The candidate computer systems that receive the recruiter's broadcast determine if they can share the job according to one or more job sharing parameters. These parameters may relate to the job itself, network performance, security, or other criteria for sharing. If a computer system meets the parameters for taking on the particular job, it responds to the recruiter. If the recruiter still needs help (e.g., if not enough candidate systems have responded yet), the recruiter grants the response and delivers the job to the computer system. The computer system then performs the job (or task) and returns the results to the recruiter.

Method and system for assigning and distributing work over a computer network

Abstract: The invention is a method and system for aligning a properly skilled external work force with a workflow task for a particular while maintaining control and quality assurance over the work product created for the business by the external workforce. The system enables the assignment and distribution of work via a computer network from a business customer having a particular task that requires a particular skill set, matching that to one or more agents over a computer network, and collecting and assimilating the at least a portion of the final work product for retrieval by the customer.

Concurrent-multitasking processor

Abstract: A concurrent multitasking processor (30) for a real-time operating system (RTOS) device includes a plurality of execution units (13,14,15) for executing a plurality of tasks simultaneously and a task selector (3) for comparing priorities of a plurality of tasks and for selecting one or more high priority tasks requesting execution. An instruction fetcher (4) fetches instructions from memory (11) for the tasks selected by the task selector (3) and stores the instructions for each task in one or more instruction queues(10). An instruction issue unit (8) attaches priority tags to instructions and sends instructions from the instruction queues (10) to a plurality of execution units (13,14,15) for execution.

On-access malware scanning

Abstract: An on-access malware scanner (anti-virus, e-mail scanner) is provided which determines whether a scan to be performed has above a threshold level of complexity and if so divides the scan into a plurality of different tasks. These different tasks are then delegated to further computers (50, 52, 54) in a distributed processing approach with the further computers then returning their task results to the coordinating computer for combination to form an overall scan result. Computer files containing embedded files may be divided into separate computer files that are scanned as separate tasks. Furthermore, an individual computer file may be scanned for different properties by different computers as separate tasks. The selection of which tasks to distribute to which further computers may be made in dependence upon the complexity of the task to be delegated, the communication channel bandwidth to that further computer and the processing resources available at that further computer.

Dynamic allocation of computing tasks by second distributed server set

Abstract: A method for dynamic allocation of computing tasks includes requesting a computing task by a client; receiving the computing task by a first distributor server set; redirecting the computing task to a second distributor server set, the second distributor server set including a first server; and allocating the computing task from the first server to a second server that executes the computing task, where the allocation is based on matching an attribute of the second server to an attribute of the computing task.

The Natural Work-Stealing Algorithm is Stable

Abstract: In this paper we analyse a very simple dynamic workstealing algorithm. In the work-generation model, there are n generators which are arbitrarily distributed among a set of n processors. During each time-step, with probability \lambda, each generator generates a unit-time task which it inserts into the queue of its host processor. After the new tasks are generated, each processor removes one task from its queue and services it. Clearly, the work-generation model allows the load to grow more and more imbalanced, so, even when \lambda < 1, the system load can be unbounded.The natural work-stealing algorithm that we analyse works as follows. During each time step, each empty processor sends a request to a randomly selected other processor. Any non-empty processor having received at least one such request in turn decides (again randomly) in favour of one of the requests. The number of tasks which are transferred from the non-empty processor to the empty one is determined by the so-called work-stealing function f.We analyse the long-term behaviour of the system as a function of \lambda and f. We show that the system is stable for any constant generation rate \lambda < 1 and for a wide class of functions f. We give a quantitative description of the functions f which lead to stable systems. Furthermore, we give upper bounds on the average system load (as a function of f and n).

The master-slave paradigm with heterogeneous processors

Abstract: In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm that gives the optimal solution when a single communication is needed before the execution of the tasks on the slave processors. When communications are required both before and after the task processing, we show that the problem is at least as difficult as a problem whose complexity is open. In this case, we present a guaranteed approximation algorithm. Finally, we present asymptotically optimal algorithms when communications are required before the processing of each task, or both before and after the processing of each task.

Task based priority arbitration

Abstract: A digital system and method of operation is provided in which several processors (1400, 1402, 1404) are connected to a shared resource (1432). Each processor has an access priority register (1410) that is loaded with an access priority value by software executing on the processor. Arbitration circuitry (1430) is connected to receive a request signal from each processor along with the access priority value from each access priority register. The arbitration circuitry is operable to schedule access to the shared resource according to the access priority values provided by the processors. A software priority state is established during execution of an instruction module on each of the several processors. An instruction is executed on each processor to form an access request to the shared resource. An access priority value is provided with each access request that is responsive to the software priority state of the respective processor. The sequence of instructions is part of a task and the software state is established by defining a task priority for the task and setting the software state in accordance with the task priority. The software priority state is saved during a context switch.

Golf course yardage and information system with zone detection

Abstract: A player position determining and course management system for a golf course having a plurality of roving units for use by players in playing the course is disclosed Each roving unit includes a central processing unit (CPU) including a data processor for executing various tasks ranging from fastest-execution of a task to slowest execution of a task on a schedule of priorities of task completion, a real-time means for controlling the processor to give the tasks priority ranging from fastest execution of a task with highest priority to slowest execution of a task with lowest priority, and a means for precisely timing functions of the system including modulating means utilizing a common digital modulation technique for digitally modulating data transmitted to and from all of the roving units Each of the roving units include a monitor for displaying the golf course including each of the holes with its tee box, fairway, green, cup and hazards, as well as the position of the roving unit on the course in real time Additionally, the system includes a course management base station for transmitting and receiving information to the roving units and a monitor for displaying the location of each roving unit on the golf course in real time

System and method for processing overlapping tasks in a programmable network processor environment

Abstract: A system and method process data elements on multiple processing elements. A first processing element processes a task. A second processing element, coupled to the first processing element, is associated with a task. The first processing element sends a critical-section end signal to the second processing element while processing the task at the first processing element. The second processing element resumes the task in response to receiving the critical-section end signal.

A hybrid solution of fork/join synchronization in parallel queues

Abstract: A new analysis technique, dynamic-bubblesort analysis, is introduced for general K-queue first-in-first-out HFJ (homogenous fork/join queuing) systems of K/spl ges/2 . The dynamic-bubblesort model dynamically sorts the branches of the queues based on the number of the tasks waiting for synchronization in each branch. Jobs arrive with mean rate /spl lambda/ and a general arrival distribution. Upon arrival, a job forks into K tasks. Task k, k=1, 2, ..., K, is assigned to the kth queuing system, which is a first-in-first-out server with a general service distribution and an infinite capacity queue. A job leaves the HFJ system as soon as all its tasks complete their service. In other words, tasks corresponding to the same job are joined before departing the HFJ system. We obtain a general and simple hybrid solution which combines analysis and simulation for the mean response time that we denote by T/sub K/. We obtain a very simple (as a function of T/sub 1/ and T/sub 2/ only) and general upper bound expression for T/sub K/ and we get an exact relationship between the cases for K=2 and 3. We evaluate our results by simulating 2, 3, ..., 99, and 100 queues for p=0.1, 0.2, ....0.8, and 0.9, each for four different HFJ cases, where /spl rho/=/spl lambda///spl mu/ and /spl mu/ is the average task service rate for a server. The maximum absolute offset for our hybrid solutions from all the simulations is less than 0.33 percent (1/300), which is a reasonable error ratio for simulation. The maximum offset for our upper bounds over all the simulations is 21 percent.

A scalable, distributed algorithm for allocating workers in embedded systems

Abstract: This paper presents a scalable threshold-based algorithm for allocating workers to a given task whose demand evolves dynamically over time. The algorithm is fully distributed and solely based on the local perceptions of the individuals. Each agent decides autonomously and deterministically to work only when it "feels" that some work needs to be done based on its sensory inputs. In this paper, we applied the worker allocation algorithm to a collective manipulation case study concerned with the gathering and clustering of initially scattered small objects. The aggregation experiment has been studied at three different experimental levels by using macroscopic and microscopic probabilistic models, and embodied simulations. Results show that teams using a number of active workers dynamically controlled by the allocation algorithm achieve similar or better performances in aggregation than those characterized by a constant team size, while using a considerably reduced number of agents over the whole aggregation process. Since this algorithm does not imply any form of explicit communication among agents, it represents a cost-effective solution for controlling the number of active workers in embedded systems consisting of a few to thousands of units.

Operating systems techniques for reducing processor energy consumption

Abstract: In the last decade, limiting computer energy consumption has become a pervasive goal in computer design, largely due to growing use of portable and embedded computers with limited battery capacities This work concerns ways to reduce processor energy consumption, since the processor consumes much of a computer’s energy Our specific contributions are as follows First, we introduce our thesis that operating systems should have a significant role in processor energy management The operating system knows what threads and applications are running, and can predict their future requirements based on their past usage and their user interaction We motivate using software to control energy management decisions by describing how software has traditionally been applied to this regime Next, we describe operating system techniques for increasing processor sleep time We suggest never running blocked processes, and delaying processes that execute without producing output or otherwise signaling useful activity These techniques reduce CPU energy by 47-66% Next, we address ways to dynamically change a processor’s speed and voltage We suggest considering what tasks the system is working on and their performance needs, then using a speed schedule that just meets those needs We show that the optimal schedule increases speed as a task progresses according to a formula dependent on the probability distribution of task CPU requirement Such a schedule can reduce CPU energy consumption by 206% on average, with no effect on performance Next, we analyze real user workloads to evaluate ways to infer task information from observations of user interface events We find that observable differences in such events have significant effects on CPU usage Using such information in estimating the probability distribution of task CPU requirements can reduce energy consumption by a further 05-15% Finally, we implement our methods We deal with I/O wait time, overlap of multiple simultaneous tasks, limited speed/voltage settings, limited timer granularity, and limited ability to modify an operating system The resulting task-based scheduler implements our energy-saving methods with 12% background overhead We find that our methods will be more effective on future processors capable of a wider range of speeds than modern processors

System and method for parallelizing file archival and retrieval

Abstract: A database management system and associated methods for parallelizing file archival and retrieval in an extended database management system. The system includes a set of copy agents that selectively acquire the backup tasks from a copy queue, and a set of retrieval agents that selectively acquire the restore tasks from a restore queue. The chances of contention between any two copy agents or any two retrieve agents acquiring the same copy or restore task is significantly minimized. Once specific copy agents are assigned backup tasks, the backup process is implemented to determine the optimal way to write the backup files to one or more targets, in parallel. In addition, the present system enables the efficient and expeditious retrieval of the desired files without having to search all the targets.

Design Space Exploration for Massively Parallel Processor Arrays

Abstract: In this paper, we describe an approach for the optimization of dedicated co-processors that are implemented either in hardware (ASIC) or configware (FPGA). Such massively parallel co-processors are typically part of a heterogeneous hardware/software-system. Each coprocessor is a massive parallel system consisting of an array of processing elements (PEs). In order to decide whether to map a computational intensive task into hardware, existing approaches either try to optimize for performance or for cost with the other objective being a secondary goal. Our approach presented here, instead, a) considers multiple objectives simultaneously. For a given specification, we explore space-time-mappings leading to different degrees of parallelism and cost, and different optimal hardware solutions. b) We show that the hardware cost may be efficiently determined in terms of the chosen space-time mapping by using state-of-the-art techniques in polyhedral theory. c) Finally, we introduce ideas to drastically reduce dimension and size of the search space of mapping candidates. d) The feasibility of our approach is shown for two realistic examples.