WO2001082075A2 - System and method for scheduling execution of cross-platform computer processes - Google Patents

System and method for scheduling execution of cross-platform computer processes Download PDF

Info

Publication number
WO2001082075A2
WO2001082075A2 PCT/US2001/013138 US0113138W WO0182075A2 WO 2001082075 A2 WO2001082075 A2 WO 2001082075A2 US 0113138 W US0113138 W US 0113138W WO 0182075 A2 WO0182075 A2 WO 0182075A2
Authority
WO
WIPO (PCT)
Prior art keywords
computer
processes
execute
computers
processor
Prior art date
Application number
PCT/US2001/013138
Other languages
French (fr)
Other versions
WO2001082075A3 (en
Inventor
Michael G. Foulger
Thomas R. Chipperfield
Jeremy S. Cooper
Original Assignee
Icplanet Acquisition Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=22737342&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=WO2001082075(A2) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Icplanet Acquisition Corporation filed Critical Icplanet Acquisition Corporation
Priority to AU2001255611A priority Critical patent/AU2001255611A1/en
Publication of WO2001082075A2 publication Critical patent/WO2001082075A2/en
Publication of WO2001082075A3 publication Critical patent/WO2001082075A3/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5044Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering hardware capabilities

Definitions

  • the present invention relates to a system, method, and computer program product for scheduling the execution of computer processes in a network environment.
  • Distributed refers to physically separated computers that are capable of communicating with one another and/or with a central computer.
  • One such system includes a plurality of distributed computers, wherein each of the computers has its own operating system, which is different from at least one of the other computers.
  • Unix-based computers execute computer programs compatible with Unix
  • Microsoft Windows NT based computers execute computer programs compatible with Windows NT.
  • the Unix compatible computer programs can be incompatible with the Windows NT based computers, and vice versa.
  • the Unix and Windows NT compatible programs are collectively referred to as cross- platform processes because the processes collectively execute on plural computer platforms, wherein each computer platform respectively hosts an operating system different from the operating systems hosted by at least one of the other computer platforms. It is desirable in such a distributed system to coordinate the execution of the computer programs on the distributed computers, so as to achieve one or more useful results. Coordinating the execution of the computer programs requires scheduling the computer programs to execute on the different, incompatible, and distributed Unix and Windows NT based computers. It is desirable to schedule the computer programs to execute in a preferably user defined executing sequence. It is further desirable to schedule the computer programs to execute in a sequence that depends on the execution results produced by executing or executed computer programs. It is even further desirable to define the scheduling sequence and then control the scheduling sequence (that is, the sequence in which the distributed computer programs are executed) from a centralized location and computer.
  • the present invention meets the above-mentioned needs and advantageously provides the above-mentioned desired features.
  • the present invention provides a system, method and computer program product for scheduling cross-platform computer programs or processes to execute on distributed computers having operating systems compatible with the processes associated with the computers, each of the computers having an operating system that is different from the operating system of at least one of the other distributed computers.
  • the present invention advantageously schedules the computer programs to execute on the computers in a user defined executing sequence.
  • the present invention advantageously schedules the computer programs to execute on the computers in a sequence that depends on the execution results produced by executing or executed computer programs.
  • the scheduling sequence is defined at a centralized computer that can communicate with each of the distributed computers. Then, the centralized computer controls the scheduling sequence (that is, the sequence in which the distributed computer programs are executed). In the present invention, the centralized computer and the distributed computers are advantageously networked together.
  • the present invention provides a system for scheduling the execution of cross-platform computer processes on client computers.
  • the client computers include first and second distinct computers having respective first and second different operating systems.
  • the system includes a process scheduling computer coupled to the first and second computers.
  • the process scheduling computer includes a scheduler that schedules a first process compatible with the first operating system and a second process compatible with the second operating system to respectively execute on the first and second client.
  • the system also includes a master schedule that is accessible to the scheduler.
  • the master schedule includes a first process identifier identifying the first process and a second process identifier identifying the second process, the first and second process identifiers being linked together to define an executing sequence of the first and second processes, wherein the scheduler schedules the first and second processes to execute on the respective first and second computers according to the defined executing sequence.
  • the master schedule also includes one or more conditional interrelationships between the first and second processes, wherein the scheduler schedules the first and second processes to execute based on the one or more conditional inter-relationships.
  • the one or more conditional inter-relationships include a success criteria associated with the first process.
  • the scheduler includes means for executing the first process, means for comparing the success criteria to execution results produced by the first process, and means for determining whether the first process executed successfully based on a comparison result produced by the comparing means.
  • the present invention further provides a method and a computer program product for scheduling computer processes to execute in accordance with the above mentioned system for performing same.
  • FIG. 1 is an illustration of a system according to an embodiment of the present invention.
  • FIG. 2 is an illustration of an exemplary master schedule used in the present invention to schedule processes.
  • FIG. 3 is a flow chart of a high-level method according to an embodiment of the present invention.
  • FIG. 4 is an exemplary series of detailed method steps corresponding to a scheduling method step of FIG. 3.
  • FIG. 5 A is a diagram of an example internetwork environment according to the present invention.
  • FIG.5B is an illustration of a simplified four-layered communication model supporting Web commerce including an application layer, a transport layer, an Internet layer, and a physical layer.
  • FIG. 5C is an exemplary computer architecture on which the present invention can be implemented. Detailed Description of the Preferred Embodiments
  • Fig. 1 is an illustration of a system 100 according to an embodiment of the present invention.
  • System 100 includes a plurality of client computers 102a-102n (also referred to as client or clients 102) coupled to a computer communication network 104.
  • a plurality of processes or tasks 106a-106n are respectively assigned to client computers 102a-102n.
  • Each client for example, client 102a
  • can execute one or more processes for example, processes 106a assigned to the client.
  • a server computer 108 (also referred to as server 108) is coupled to computer communication network 104.
  • Server computer 108 includes a Master
  • Scheduling Engine (MSE) 110 for scheduling processes 106a- 106n to execute on associated clients 102a- 102n, according to the present invention.
  • clients 102 can be thought of as "scheduling clients” because the clients are schedule clients of the MSE 110.
  • clients 102 can operate as both servers or clients in a server-client environment, such as the Internet.
  • a master schedule
  • server 108 residing in or external to server 108, is accessible to server 108.
  • server 108 generates master schedule 112 and accesses the contents of master schedule 112 to facilitate the scheduling of processes 106 for execution.
  • Server 108 communicates with clients 102 over communication network 104, which can be any known computer communication network, including the Internet, a company intranet, a local area network (LAN), a wide area network (WAN), the Public Switch Telephone Network (PSTN), and so on.
  • IP Public Switch Telephone Network
  • Client 102a includes a message interface 120 for sending information (such as messages) to and receiving information from server 108 and the other clients via communication network 104.
  • client 102a may also include a Graphical User Interface (GUI) 122 for permitting a user to enter information and commands into client 102a and for displaying information to the user.
  • GUI Graphical User Interface
  • Client 102a operates (for example, executes processes) under an operating system 124.
  • Operating system 124 responds to user commands entered via GUI 102a, and also responds to commands and/or messages received from server 108 via message interface 120.
  • Server 108 includes a message interface 130 for sending information (such as messages) to and receiving information from clients 102 via communication network 104.
  • Server 108 also includes a GUI 132 for permitting a user to enter information and commands into server 108 and for displaying information to the user.
  • Server GUI 132 and client GUI 122 can be, for example, web-based or browser GUIs.
  • the MSE 110 is responsive to information including messages received from clients 102 over communication network 104 (and via interface
  • the MSE 110 generates master schedule 112 in response to such user input and the information received from clients 102.
  • Each client executes one or more processes 106, as mentioned above.
  • a process is an executable program, such as a compiled program or "executable", a program script, and any other type of executable program that can be executed on a computer, as would be apparent to one skilled in the relevant art. Such processes are often also referred to as "tasks", as is known in the art.
  • a client (for example, client 102a) can execute a process after the process has been installed on the client computer. Installing a process in a client computer typically includes loading the process, for example, a compiled program, into client computer memory such that the client computer can execute the process to produce a useful result. Typically, the installed process is executed under the supervision of the client OS.
  • Each of processes 106 (for example, process 106a). can be several processes installed on an associated client 102 (for example, client 102a).
  • system 100 may include at least one scheduling client 102m (and associated processes) which is physically located on the same computer as server
  • At least two of client computers 102a-102n are distinct from one another.
  • each of the at least two client computers includes, for example, its own processing unit for executing program instructions, memory, user interface hardware (such as, a keyboard), display, logical configuration (for example, its own operating system), etc.
  • client computer 102a comprises a first computer workstation or platform
  • client computer 102b comprises a second computer platform.
  • the two distinct clients have different operating systems.
  • client 102a runs under a Microsoft
  • system 100 has a "cross-platform" configuration, meaning that a plurality of processes can execute on a plurality of associated clients, each having different operating systems. It is envisioned that system 100 includes many distinct computer platforms that respectively operate under many different operating systems. The different operating systems can be any presently known or future developed operating systems.
  • client computers 102a-n may each operate under a first operating system (e.g., Unix), while server 108 may operate under a second, distinct operating system (e.g., Windows NT).
  • first operating system e.g., Unix
  • server 108 may operate under a second, distinct operating system (e.g., Windows NT).
  • client 102a is a Microsoft Windows NT platform
  • client 102b is a Unix based platform.
  • processes 106a can execute on client 102a only under the Windows NT OS
  • processes 106b can execute on client 102b only under the Unix based OS. Accordingly, only
  • Windows NT compatible processes processes 106a
  • Unix compatible processes processes 106b
  • the MSE 110 advantageously performs cross-platform scheduling, whereby Windows NT compatible processes 106a and Unix compatible processes 106b are scheduled to execute on respective compatible clients 102a and 102b in accordance with a user defined executing sequence captured in master schedule 112, as will be described in further detail below.
  • the cross-platform processes 106 are advantageously scheduled to execute on associated clients 102 from one central controller (that is, the MSE 110).
  • FIG. 2 is an illustration of an exemplary master schedule 112.
  • Master schedule 112 includes a process identifier column 202 for listing process identifiers identifying all of the processes 106 installed in and to be executed on associated clients 102.
  • Master schedule 112 includes a client address column 204 for listing client network addresses corresponding to clients 102, to enable server
  • Master schedule 112 includes a result criteria column 206 for listing criteria associated with the execution of corresponding processes on clients 102. Such criteria can include, for example, expected outcomes or results produced by processes when the processes execute to successful completions.
  • Master schedule 112 also includes a action column 210 for listing actions, for example branching commands, that define the sequence in which processes 106a-106n are to be executed (this is also referred to as the "executing sequence" of processes 106).
  • the actions can be conditional, that is, dependent upon the outcome or results reported by an executed process. Alternatively, the actions can be unconditional, that is, not dependent on such an outcome.
  • Master schedule 112 can optionally include an operating system column 212 for listing the operating systems under which the processes listed in column 202 will run. In an embodiment, master schedule may also include a column (not shown in
  • FIG. 2 for listing process priorities corresponding to each of the identified process. For example, processes can be identified as having high, medium or low execution priorities.
  • Master schedule 112 includes a plurality of records or rows 220a-220n, each corresponding to a process that is scheduled to be executed in system 100.
  • Each row includes a plurality of fields for respectively storing information associated with columns 202-212, described above.
  • row 220a includes a field 230 for storing a process identifier "pi" identifying one of the process 106a in FIG. 1.
  • Row 220a includes a field 231 for storing an exemplary client address corresponding to client 102a.
  • Row 220a also includes a field 232 for storing the following exemplary actions:
  • actions ( 1 ) and (2)) direct the MSE 110 to cause the processes identified in column 202 of master schedule 112 to execute in a defined executing sequence. Assume, for example, process pi is currently executing on Windows NT client 102a, and process p2 is installed and waiting to be executed on Unix based client 102b.
  • Action (1) above directs MSE 110 to re-execute process pi on client 102b when it is determined that process pi failed because, for example, pi did not successfully execute to completion or returned erroneous data to a monitoring function of the MSE 1 10.
  • action (2) directs MSE 1 10 to execute process p2 on client 102b when it is determined, for example, that process pi executed to successful completion.
  • the actions could be redefined to direct the MSE 110 to execute process p2 when it is determined pi has executed successfully, or to execute p3 instead of p2, when it is determined pi did not execute successfully.
  • master schedule 112 may include timing information which would allow MSE 1 10 to execute processes on a pre-determined schedule (e.g., hourly, daily, weekly, etc.).
  • FIG. 3 is a flow chart of a high-level method 300 according to an embodiment of the present invention. Method 300 is described with reference to system 100 and under the assumption that at least two of clients 102 are distinct and are operating under different operating systems, as described above.
  • all client computers 102a-n may each operate under a first operating system (e.g., Unix), while server 108 may operate under a second, distinct operating system (e.g., Windows NT).
  • first operating system e.g., Unix
  • second operating system e.g., Windows NT
  • the configuration of system 100 may include scheduling clients 102a and 102b (and associated their processes) which are physically located (and executing) on the same computer.
  • method 300 begins at a step 305 when processes 106a-106n are installed to execute on respective clients 102a-102n.
  • one or more Windows NT compatible processes 106a are installed on Windows NT based client 102a
  • one or more Unix compatible processes are installed on Unix based client 102b.
  • the client sends a notification message to server 108 indicating the installed process needs to be scheduled for execution.
  • the notification message includes a process identifier (for example "pi").
  • server 108 will assign the process identifier.
  • an OS type identifier (for example, "Unix") identifying the type of OS residing on the client is also included in the notification message from client 102 to server 108.
  • server 108 receives the notification message or messages corresponding to each installed process.
  • notification messages are displayed to a user at server 108.
  • the user enters information and commands into server 108 as necessary to construct master schedule 112.
  • Such information includes the information required to populate the fields of each of rows 220a- 220n, where each row corresponds to an installed process that needs to be scheduled for execution.
  • the fields of results criteria column 206 are populated with result criteria.
  • Such criteria includes success criteria by which the successful execution of the corresponding processes can be judged or determined.
  • the fields of action column 210 are populated with actions, such as branch commands similar to the action (1) and action (2) mentioned above, defining executing sequences of the installed processes (identified in column 202 of master schedule 112).
  • step 310 The user can also enter process executing priorities for the installed processes into master schedule 112.
  • master schedule 112 links together the installed processes, associated with process identifiers in column 202, in such a way as to define executing sequences for the cross-platform processes 106. It is to be understood that the particular form of the construct used to link processes 106 together in master schedule 112 (such as goto statements) is not limited to those depicted in FIG. 2. Any construct, such as linked links, and the like, that would be apparent to one skilled in the relevant art, can be used.
  • the MSE 1 10 schedules cross-platform processes 106 to execute on clients 102.
  • Run-time scheduling step 315 is now described in further detail with reference to FIG. 4, wherein exemplary detailed method steps 400 corresponding to method step 315, are depicted.
  • the MSE 110 accesses master schedule 112 to determine which one of the processes 106 (for example process pi) is to be executed "next". Depending on the processing requirements associated with system 100, master schedule 112 can indicate that several processes 106 are to be executed concurrently, "next". Initially, the "next" process is the first process (or processes) that is to be executed in master schedule 112 (for example, process pi).
  • the MSE 110 sends an "initiate execution command" to each of the clients 102 (for example, client 102a) hosting an installed process that is to be executed "next". This command prompts the operating system of the client that receives the command to initiate execution of the process identified in the command.
  • the MSE 110 monitors interface 130 for an incoming status message from any of clients 102.
  • Each status message includes a process identifier and a client identifier respectively identifying the sending client and associated process.
  • the status message also includes process execution results produced by the associated process during execution of the process, or when the process completes execution.
  • the process execution results can indicate, for example, that the process successfully executed to completion, or that the process did not successfully execute to completion.
  • the MSE 1 10 uses the process identifier included in the received status message to access and retrieve the appropriate result criteria in the appropriate row of the master schedule 112.
  • the MSE 110 compares the retrieved result criteria to the process execution results included in the status message.
  • the MSE 110 determines which process scheduling action is appropriate based on comparison step 420 and the action information stored in action column 210 of master schedule 112, as described above in connection with the FIG. 2. In other words, the MSE 110 determines a "next" process to be executed, and flow control proceeds back to step 410.
  • master schedule 112 and the MSE 110 together form a dynamic and flexible, centralized, cross-platform process scheduling mechanism, whereby a process executing sequence can be based on execution results produced by the processes identified in the master schedule. In other words, the executing sequence can be adjusted based on the execution results, the user defined result criteria, and the actions defined in the master schedule 112.
  • the MSE 110 determines which process scheduling action is appropriate based on the above mentioned factors, and in addition, on a process priority stored in master schedule 112. For example, the MSE 110 may cause a high priority "next" process to preempt a low priority "next" process on one of clients 102.
  • the MSE 110 monitors a processing loading or "busy-state" of each of clients 102. In this embodiment, the MSE 110 determines which process scheduling action is appropriate based on the factors described above in connection with method steps 420 and 425, and in addition, on the "busy-state" of each client. This embodiment gives the MSE 110 the flexibility to transfer "next" processes from busy clients to available clients, and to initiate execution of the transferred "next" processes on the available clients.
  • the MSE 110 determines which "next" processes are scheduled to be executed on busy clients.
  • the MSE 110 also determines which clients are available to execute processes. Assuming the MSE 110 determines that one or more clients are available, the MSE sends "process transfer" commands to the busy clients associated with the "next" processes. Each process transfer command received by a busy client directs the busy client to transfer its "next" installed process to an available client identified by a client destination address in the transfer command. Each available destination client has an operating system compatible with the busy client from where the process is being transferred. MSE 110 is able to determine such compatible client transfer pairs based on the OS type information in column 212 of master schedule 112.
  • Client 102a is an Internet, Web-server having a Sun/Solaria Unix based operating system.
  • An Internet information gathering process installed on client 102a e.g., a Web search engine or crawler
  • jobl is used to automatically search Internet-web sites for predetermined information, collect "found” information, and send the found information to another computer within the same network. All of this is referred to as "jobl.”
  • the particular web-information collected by the Internet information gathering process of client 102a is passed to client 102b.
  • Client 102b is a work station operating under the Windows NT OS.
  • a chart generating process installed on client 102b is used to generate bit mapped charts based on the web-information passed to client 102b.
  • the charts are displayed to a user. This is referred to as "job2".
  • the chart generating process of client 102b submits queries to a database application (this is referred to as "job3") residing on client 102c, which is also a Windows NT based client.
  • a master schedule 112 is generated to schedule the following conditional executing sequence of processes (i.e., jobl, job2 and iob3): 1. j ob 1 (Execute the information gathering process on client 102a to collect web information and then pass the gathered web information to client 102b);
  • a Unix based client 102a executes the web-based information gatherer (J 001 ) described above, a Unix based client 102b executes a parser to parse the gathered information (jobl), and a Windows NT based client 102c executes an email generator to generate email messages available to a user (j°b3 and job4).
  • the jobs are scheduled to execute according to the following master schedule:
  • master schedule 112 can be constructed such that several jobs are queued for scheduled execution on one or more of clients 102.
  • the present invention can be implemented in any communication network, such as, the Internet, which supports interactive services and applications.
  • the present invention can be implemented in any Web service, preferably a Web service supporting secure transactions, such as, the
  • SSL Secure Socket Layer
  • S-HTTP Secure HyperText Transport Protocol
  • the present invention is implemented in a multi-platform (platform independent) programming language such as Java.
  • Java-enabled browsers are used, such as, Netscape, HotJava, and Microsoft Explorer browsers.
  • Active content Web pages can be used. Such active content
  • Web pages can include Java applets or ActiveX controls, or any other active content technology developed now or in the future.
  • the present invention is not intended to be limited to Java or Java-enabled browsers, and can be implemented in any programming language and browser, developed now or in the future, as would be apparent to a person skilled in the art given this description.
  • the present invention is not intended to be limited to a Web- based implementation or environment and can be implemented in any communication network now or in the future, as would be apparent to a person skilled in the art given this description. Even further, the present invention can operate in the absence of a network, for example, on a computer not connected with a network.
  • FIG. 5 A is a diagram of an example internetwork environment according to the present invention.
  • FIG. 5A shows a communication network or combination of networks (Internet) 500 (corresponding to communication network 104 of FIG. 1 ) which can support the invention.
  • Internet 500 consists of interconnected computers which supports communication between many different types of users including businesses, universities, individuals, government, and financial institutions.
  • Internet 500 supports mam- different types of communication links implemented in a variety of architectures. For example, voice and data links can be used including phone, paging, cellular, and cable TV (CATV) links.
  • Terminal equipment can include local area networks, personal computers with modems, content servers of multi-media, audio, video, and other information, pocket organizers, personal digital assistants (PDAs), and set-top boxes.
  • PDAs personal digital assistants
  • FIG. 5B shows a simplified four-layered communication model supporting Web commerce including an application layer 508, transport layer 510, Internet layer 520, physical layer 530.
  • application layer 508 represents the different tools and information services which are used to access the information over the Internet. Such tools include, but are not limited to, telenet log-in service 501, IRC chat 502, Web service 503, and SMTP (Simple Mail
  • Transfer Protocol electronic mail service 506.
  • Web service 503 allows access to HTTP documents 504, and FTP and Gopher files 505.
  • a Secure Socket Layer (SSL) is an optional protocol used to encrypt communications between a Web browser and Web server. Description of the example environment in these terms is provided for convenience only. It is not intended that the invention be limited to application in this example environment. In fact, after reading the following description, it will become apparent to a person skilled in the relevant art how to implement the invention in alternative environments.
  • FIG. 5C An example of a computer system 540 is shown in FIG. 5C.
  • the computer system 540 represents any single or multi-processor computer. Single or multi-tasking computers can be used. Unified or distributed memory systems can be used.
  • Computer system 540 includes one or more processors, such as processor 544.
  • computer system 540 corresponds to server 108 of FIG. 1, wherein scheduling engine 110 (also referred to as scheduler 110) comprises one or more processors 544 for executing software implemented methods 300 and 400 as described above, and as appropriate.
  • Each processor 544 is connected to a communication infrastructure 542 (e.g., a communications bus, cross-bar, or network).
  • a communication infrastructure 542 e.g., a communications bus, cross-bar, or network.
  • Computer system 540 also includes a main memory 546, preferably random access memory (RAM), and can also include a secondary memory 548.
  • the secondary memory 548 can include, for example, a hard disk drive 552 and/or a removable storage drive 552, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc.
  • the removable storage drive 552 reads from and/or writes to a removable storage unit 554 in a well known manner.
  • Removable storage unit 554 represents a floppy disk, magnetic tape, optical disk, etc., which is read by and written to by removable storage drive 552.
  • the removable storage unit 554 includes a computer usable storage medium having stored therein computer software and/or data.
  • secondary memory 560 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 540.
  • Such means can include, for example, a removable storage unit 562 and an interface 560. Examples can include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 562 and interfaces 560 which allow software and data to be transferred from the removable storage unit 562 to computer system 540.
  • Computer system 540 can also include a communications interface 564. Communications interface 564 allows software and data to be transferred between computer system 540 and external devices via communications path 566.
  • communications interface 564 can include a modem, a network interface (such as Ethernet card), a communications port, etc.
  • Software and data transferred via communications interface 564 are in the form of signals 568 which can be electronic, electromagnetic, optical or other signals capable of being received by communications interface 564, via communications path 566.
  • communications interface 564 provides a means by which computer system 540 can interface to a network such as the Internet.
  • the present invention can be implemented using software running (that is, executing) in an environment similar to that described above with respect to FIG. 5A.
  • computer program product is used to generally refer to removable storage unit 554, a hard disk installed in hard disk drive 552, or a carrier wave carrying software over a communication path 566
  • a computer useable medium can include magnetic media, optical media, or other recordable media, or media that transmits a carrier wave or other signal.
  • Computer program products are means for providing software to computer system 540.
  • Computer programs also called computer control logic
  • Computer programs are stored in main memoiy 546 and/or secondary memory 548.
  • Computer programs can also be received via communications interface 564.
  • Such computer programs when executed, enable the computer system 540 to perform the features of the present invention as discussed herein.
  • the computer programs when executed, enable the processor 544 to perform the features of the present invention, as related to proximity searching. Accordingly, such computer programs represent controllers of the computer system 540.
  • the present invention can be implemented as control logic in software, firmware, hardware or any combination thereof.
  • the software may be stored in a computer program product and loaded into computer system 540 using removable storage drive 552, hard drive 550, or interface 560.
  • the computer program product may be downloaded to computer system 540 . over communications path 566.
  • the control logic when executed by the one or more processors 544, causes the processor(s) 544 to perform the functions of the invention as described herein.
  • the invention is implemented primarily in firmware and/or hardware using, for example, hardware components such as application specific integrated circuits (ASICs).
  • ASICs application specific integrated circuits

Abstract

A distributed computing system includes at least first and second distinct computers each having a different operating system. First processes are compatible with the first operating system and second processes are compatible with the second operating system. A third scheduling computer, coupled to the first and second computer via a communication network, includes a scheduler for scheduling the first processes and the second processes to execute respectively on the first and second computers. The scheduler accesses a master schedule that defines an executing sequence of the first processes and the second processes. The master schedule can define conditional inter-relationships between the first processes and the second processes.

Description

SYSTEM AND METHOD FOR SCHEDULING EXECUTION OF CROSS- PLATFORM COMPUTER PROCESSES
Background of the Invention
Field of the Invention
The present invention relates to a system, method, and computer program product for scheduling the execution of computer processes in a network environment.
Related Art
Known distributed computing systems are useful for performing a variety of different computing tasks. "Distributed" refers to physically separated computers that are capable of communicating with one another and/or with a central computer. One such system includes a plurality of distributed computers, wherein each of the computers has its own operating system, which is different from at least one of the other computers. For example, numerous Unix-based computers execute computer programs compatible with Unix, while numerous Microsoft Windows NT based computers execute computer programs compatible with Windows NT. The Unix compatible computer programs can be incompatible with the Windows NT based computers, and vice versa. The Unix and Windows NT compatible programs are collectively referred to as cross- platform processes because the processes collectively execute on plural computer platforms, wherein each computer platform respectively hosts an operating system different from the operating systems hosted by at least one of the other computer platforms. It is desirable in such a distributed system to coordinate the execution of the computer programs on the distributed computers, so as to achieve one or more useful results. Coordinating the execution of the computer programs requires scheduling the computer programs to execute on the different, incompatible, and distributed Unix and Windows NT based computers. It is desirable to schedule the computer programs to execute in a preferably user defined executing sequence. It is further desirable to schedule the computer programs to execute in a sequence that depends on the execution results produced by executing or executed computer programs. It is even further desirable to define the scheduling sequence and then control the scheduling sequence (that is, the sequence in which the distributed computer programs are executed) from a centralized location and computer.
Therefore, what is needed is a system, method and computer program product for coordinating the execution of the computer programs on distributed computers and having the above-mentioned desirable features.
Summary of the Invention
The present invention meets the above-mentioned needs and advantageously provides the above-mentioned desired features. The present invention provides a system, method and computer program product for scheduling cross-platform computer programs or processes to execute on distributed computers having operating systems compatible with the processes associated with the computers, each of the computers having an operating system that is different from the operating system of at least one of the other distributed computers.
The present invention advantageously schedules the computer programs to execute on the computers in a user defined executing sequence.
The present invention advantageously schedules the computer programs to execute on the computers in a sequence that depends on the execution results produced by executing or executed computer programs.
In the present invention, the scheduling sequence is defined at a centralized computer that can communicate with each of the distributed computers. Then, the centralized computer controls the scheduling sequence (that is, the sequence in which the distributed computer programs are executed). In the present invention, the centralized computer and the distributed computers are advantageously networked together.
In one embodiment, the present invention provides a system for scheduling the execution of cross-platform computer processes on client computers. The client computers include first and second distinct computers having respective first and second different operating systems. The system includes a process scheduling computer coupled to the first and second computers. The process scheduling computer includes a scheduler that schedules a first process compatible with the first operating system and a second process compatible with the second operating system to respectively execute on the first and second client.
The system also includes a master schedule that is accessible to the scheduler. The master schedule includes a first process identifier identifying the first process and a second process identifier identifying the second process, the first and second process identifiers being linked together to define an executing sequence of the first and second processes, wherein the scheduler schedules the first and second processes to execute on the respective first and second computers according to the defined executing sequence. The master schedule also includes one or more conditional interrelationships between the first and second processes, wherein the scheduler schedules the first and second processes to execute based on the one or more conditional inter-relationships. The one or more conditional inter-relationships include a success criteria associated with the first process. The scheduler includes means for executing the first process, means for comparing the success criteria to execution results produced by the first process, and means for determining whether the first process executed successfully based on a comparison result produced by the comparing means. The present invention further provides a method and a computer program product for scheduling computer processes to execute in accordance with the above mentioned system for performing same.
Additional features and advantages of the present invention, as well as the structure and operation of various embodiments of the present invention, are described in detail below with reference to the accompanying drawings.
Brief Description of the Figures
The accompanying drawings, which are incorporated herein and form part of the specification, illustrate the present invention and, together with the description, further serve to explain the principles of the invention and to enable a person skilled in the pertinent art make and use the invention.
FIG. 1 is an illustration of a system according to an embodiment of the present invention. FIG. 2 is an illustration of an exemplary master schedule used in the present invention to schedule processes.
FIG. 3 is a flow chart of a high-level method according to an embodiment of the present invention.
FIG. 4 is an exemplary series of detailed method steps corresponding to a scheduling method step of FIG. 3.
FIG. 5 A is a diagram of an example internetwork environment according to the present invention.
FIG.5B is an illustration of a simplified four-layered communication model supporting Web commerce including an application layer, a transport layer, an Internet layer, and a physical layer.
FIG. 5C is an exemplary computer architecture on which the present invention can be implemented. Detailed Description of the Preferred Embodiments
Fig. 1 is an illustration of a system 100 according to an embodiment of the present invention. System 100 includes a plurality of client computers 102a-102n (also referred to as client or clients 102) coupled to a computer communication network 104. A plurality of processes or tasks 106a-106n are respectively assigned to client computers 102a-102n. Each client (for example, client 102a) can execute one or more processes (for example, processes 106a) assigned to the client.
A server computer 108 (also referred to as server 108) is coupled to computer communication network 104. Server computer 108 includes a Master
Scheduling Engine (MSE) 110 for scheduling processes 106a- 106n to execute on associated clients 102a- 102n, according to the present invention. Note that clients 102 can be thought of as "scheduling clients" because the clients are schedule clients of the MSE 110. However, clients 102 can operate as both servers or clients in a server-client environment, such as the Internet. A master schedule
112, residing in or external to server 108, is accessible to server 108. According to the present invention, server 108 generates master schedule 112 and accesses the contents of master schedule 112 to facilitate the scheduling of processes 106 for execution. Server 108 communicates with clients 102 over communication network 104, which can be any known computer communication network, including the Internet, a company intranet, a local area network (LAN), a wide area network (WAN), the Public Switch Telephone Network (PSTN), and so on. An exemplary network and computer environment in which the present invention can be implemented is described in further detail below, in connection with FIGs. 5A, 5B and 5C.
A logical configuration of client 102a, in an embodiment of the present invention that is typical of the other clients in system 100, is depicted in FIG. 1. Client 102a includes a message interface 120 for sending information (such as messages) to and receiving information from server 108 and the other clients via communication network 104. In an embodiment of the present invention, client 102a may also include a Graphical User Interface (GUI) 122 for permitting a user to enter information and commands into client 102a and for displaying information to the user. Client 102a operates (for example, executes processes) under an operating system 124. Operating system 124 responds to user commands entered via GUI 102a, and also responds to commands and/or messages received from server 108 via message interface 120.
An exemplary logical configuration of server 108 is also depicted in FIG. 1. Server 108 includes a message interface 130 for sending information (such as messages) to and receiving information from clients 102 via communication network 104. Server 108 also includes a GUI 132 for permitting a user to enter information and commands into server 108 and for displaying information to the user. Server GUI 132 and client GUI 122 can be, for example, web-based or browser GUIs. The MSE 110 is responsive to information including messages received from clients 102 over communication network 104 (and via interface
130), and from commands and information input to server 108 via GUI 132. The MSE 110 generates master schedule 112 in response to such user input and the information received from clients 102.
Each client executes one or more processes 106, as mentioned above. A process is an executable program, such as a compiled program or "executable", a program script, and any other type of executable program that can be executed on a computer, as would be apparent to one skilled in the relevant art. Such processes are often also referred to as "tasks", as is known in the art. A client (for example, client 102a) can execute a process after the process has been installed on the client computer. Installing a process in a client computer typically includes loading the process, for example, a compiled program, into client computer memory such that the client computer can execute the process to produce a useful result. Typically, the installed process is executed under the supervision of the client OS. Each of processes 106 (for example, process 106a). can be several processes installed on an associated client 102 (for example, client 102a).
As will be appreciated by those skilled in the relevant art(s), the configuration of system 100 may include at least one scheduling client 102m (and associated processes) which is physically located on the same computer as server
108 as shown in FIG. 1.
In an embodiment of the present invention, at least two of client computers 102a-102n are distinct from one another. This means each of the at least two client computers includes, for example, its own processing unit for executing program instructions, memory, user interface hardware (such as, a keyboard), display, logical configuration (for example, its own operating system), etc. For example, client computer 102a comprises a first computer workstation or platform, while client computer 102b comprises a second computer platform. Also in accordance with the present invention, the two distinct clients have different operating systems. For example, client 102a runs under a Microsoft
Windows NT operating system (OS), while client 102b runs under any Unix based OS. Thus, system 100 has a "cross-platform" configuration, meaning that a plurality of processes can execute on a plurality of associated clients, each having different operating systems. It is envisioned that system 100 includes many distinct computer platforms that respectively operate under many different operating systems. The different operating systems can be any presently known or future developed operating systems.
It is important to note that while the present invention is described in terms of the above example, this is for convenience only and is not intended to limit the application of the present invention. In fact, after reading the following description, it will be apparent to one skilled in the relevant art(s) how to implement the following invention in alternative embodiments. For example, client computers 102a-n may each operate under a first operating system (e.g., Unix), while server 108 may operate under a second, distinct operating system (e.g., Windows NT). Consider such an exemplary "cross-platform" configuration of system 100, wherein client 102a is a Microsoft Windows NT platform and client 102b is a Unix based platform. In this exemplary configuration, processes 106a can execute on client 102a only under the Windows NT OS, and processes 106b can execute on client 102b only under the Unix based OS. Accordingly, only
Windows NT compatible processes (processes 106a) and only Unix compatible processes (processes 106b) can run on clients 102a and 102b, respectively. In the present invention, the MSE 110 advantageously performs cross-platform scheduling, whereby Windows NT compatible processes 106a and Unix compatible processes 106b are scheduled to execute on respective compatible clients 102a and 102b in accordance with a user defined executing sequence captured in master schedule 112, as will be described in further detail below. In the present invention, the cross-platform processes 106 are advantageously scheduled to execute on associated clients 102 from one central controller (that is, the MSE 110).
FIG. 2 is an illustration of an exemplary master schedule 112. Master schedule 112 includes a process identifier column 202 for listing process identifiers identifying all of the processes 106 installed in and to be executed on associated clients 102. Master schedule 112 includes a client address column 204 for listing client network addresses corresponding to clients 102, to enable server
108 to communicate with each client. Similarly, a network address of server 108 is known to each client 102. Master schedule 112 includes a result criteria column 206 for listing criteria associated with the execution of corresponding processes on clients 102. Such criteria can include, for example, expected outcomes or results produced by processes when the processes execute to successful completions.
Master schedule 112 also includes a action column 210 for listing actions, for example branching commands, that define the sequence in which processes 106a-106n are to be executed (this is also referred to as the "executing sequence" of processes 106). The actions can be conditional, that is, dependent upon the outcome or results reported by an executed process. Alternatively, the actions can be unconditional, that is, not dependent on such an outcome. Master schedule 112 can optionally include an operating system column 212 for listing the operating systems under which the processes listed in column 202 will run. In an embodiment, master schedule may also include a column (not shown in
FIG. 2) for listing process priorities corresponding to each of the identified process. For example, processes can be identified as having high, medium or low execution priorities.
Master schedule 112 includes a plurality of records or rows 220a-220n, each corresponding to a process that is scheduled to be executed in system 100.
Processes that are to be installed and executed are also referred to as "jobs". Each row includes a plurality of fields for respectively storing information associated with columns 202-212, described above. For example, row 220a includes a field 230 for storing a process identifier "pi" identifying one of the process 106a in FIG. 1. Row 220a includes a field 231 for storing an exemplary client address corresponding to client 102a. Row 220a also includes a field 232 for storing the following exemplary actions:
1. if pi fails, goto pi
2. if pi successful, goto p2 The above listed actions, along with the result criteria information of column 206, define conditional inter-relationships between the processes pi, p2 and p3. The format of the above actions as listed in FIG. 2 is exemplary, and therefore any format can be used that would be apparent to one skilled in the relevant art based on the descriptions provided above and belo . The actions (for example, actions ( 1 ) and (2)) direct the MSE 110 to cause the processes identified in column 202 of master schedule 112 to execute in a defined executing sequence. Assume, for example, process pi is currently executing on Windows NT client 102a, and process p2 is installed and waiting to be executed on Unix based client 102b. Action (1) above directs MSE 110 to re-execute process pi on client 102b when it is determined that process pi failed because, for example, pi did not successfully execute to completion or returned erroneous data to a monitoring function of the MSE 1 10. On the other hand, action (2) directs MSE 1 10 to execute process p2 on client 102b when it is determined, for example, that process pi executed to successful completion. In an another example scenario, the actions could be redefined to direct the MSE 110 to execute process p2 when it is determined pi has executed successfully, or to execute p3 instead of p2, when it is determined pi did not execute successfully. Many other conditional, process executing sequence permutations and combinations are possible by simply redefining the above described master schedule, as would be apparent to one skilled in the relevant art based on the above description. For example, as will be appreciated by those skilled in the relevant art(s), master schedule 112 may include timing information which would allow MSE 1 10 to execute processes on a pre-determined schedule (e.g., hourly, daily, weekly, etc.).
FIG. 3 is a flow chart of a high-level method 300 according to an embodiment of the present invention. Method 300 is described with reference to system 100 and under the assumption that at least two of clients 102 are distinct and are operating under different operating systems, as described above.
Again, the present invention is described under this assumption for convenience only and is not intended to limit the application of the present invention. As will be appreciated by one skilled in the relevant art(s), all client computers 102a-n may each operate under a first operating system (e.g., Unix), while server 108 may operate under a second, distinct operating system (e.g., Windows NT). In fact, as will also be appreciated by one skilled in the relevant art(s), the configuration of system 100 may include scheduling clients 102a and 102b (and associated their processes) which are physically located (and executing) on the same computer.
Returning to FIG. 3, method 300 begins at a step 305 when processes 106a-106n are installed to execute on respective clients 102a-102n. In an example scenario, one or more Windows NT compatible processes 106a are installed on Windows NT based client 102a, and one or more Unix compatible processes are installed on Unix based client 102b. Whenever a process is installed on a client 102 in the present invention, the client sends a notification message to server 108 indicating the installed process needs to be scheduled for execution. The notification message includes a process identifier (for example "pi"). In an alternative embodiment, server 108 will assign the process identifier.
In yet another embodiment, an OS type identifier (for example, "Unix") identifying the type of OS residing on the client is also included in the notification message from client 102 to server 108.
At a next step 310, server 108 receives the notification message or messages corresponding to each installed process. Such notification messages are displayed to a user at server 108. The user enters information and commands into server 108 as necessary to construct master schedule 112. Such information includes the information required to populate the fields of each of rows 220a- 220n, where each row corresponds to an installed process that needs to be scheduled for execution. For example, the fields of results criteria column 206 are populated with result criteria. Such criteria includes success criteria by which the successful execution of the corresponding processes can be judged or determined. The fields of action column 210 are populated with actions, such as branch commands similar to the action (1) and action (2) mentioned above, defining executing sequences of the installed processes (identified in column 202 of master schedule 112). The user can also enter process executing priorities for the installed processes into master schedule 112. The end result of step 310 is the generation of master schedule 112. Master schedule 112 links together the installed processes, associated with process identifiers in column 202, in such a way as to define executing sequences for the cross-platform processes 106. It is to be understood that the particular form of the construct used to link processes 106 together in master schedule 112 (such as goto statements) is not limited to those depicted in FIG. 2. Any construct, such as linked links, and the like, that would be apparent to one skilled in the relevant art, can be used. At a next, run-time step 315, the MSE 1 10 schedules cross-platform processes 106 to execute on clients 102. To do this, the MSE 1 10 accesses master schedule 112 to thereby schedule processes 106 to execute according to the executing sequence defined by the master schedule. Run-time scheduling step 315 is now described in further detail with reference to FIG. 4, wherein exemplary detailed method steps 400 corresponding to method step 315, are depicted.
At an initial step 405, the MSE 110 accesses master schedule 112 to determine which one of the processes 106 (for example process pi) is to be executed "next". Depending on the processing requirements associated with system 100, master schedule 112 can indicate that several processes 106 are to be executed concurrently, "next". Initially, the "next" process is the first process (or processes) that is to be executed in master schedule 112 (for example, process pi). At a next step 410, the MSE 110 sends an "initiate execution command" to each of the clients 102 (for example, client 102a) hosting an installed process that is to be executed "next". This command prompts the operating system of the client that receives the command to initiate execution of the process identified in the command. At a next step 415, the MSE 110 monitors interface 130 for an incoming status message from any of clients 102. Each status message includes a process identifier and a client identifier respectively identifying the sending client and associated process. The status message also includes process execution results produced by the associated process during execution of the process, or when the process completes execution. The process execution results can indicate, for example, that the process successfully executed to completion, or that the process did not successfully execute to completion.
At a next step 420, after receiving such a status message, the MSE 1 10 uses the process identifier included in the received status message to access and retrieve the appropriate result criteria in the appropriate row of the master schedule 112. The MSE 110 compares the retrieved result criteria to the process execution results included in the status message.
At a next step 425, the MSE 110 determines which process scheduling action is appropriate based on comparison step 420 and the action information stored in action column 210 of master schedule 112, as described above in connection with the FIG. 2. In other words, the MSE 110 determines a "next" process to be executed, and flow control proceeds back to step 410. In this manner, master schedule 112 and the MSE 110 together form a dynamic and flexible, centralized, cross-platform process scheduling mechanism, whereby a process executing sequence can be based on execution results produced by the processes identified in the master schedule. In other words, the executing sequence can be adjusted based on the execution results, the user defined result criteria, and the actions defined in the master schedule 112.
In another embodiment, the MSE 110 determines which process scheduling action is appropriate based on the above mentioned factors, and in addition, on a process priority stored in master schedule 112. For example, the MSE 110 may cause a high priority "next" process to preempt a low priority "next" process on one of clients 102.
In yet another embodiment, the MSE 110 monitors a processing loading or "busy-state" of each of clients 102. In this embodiment, the MSE 110 determines which process scheduling action is appropriate based on the factors described above in connection with method steps 420 and 425, and in addition, on the "busy-state" of each client. This embodiment gives the MSE 110 the flexibility to transfer "next" processes from busy clients to available clients, and to initiate execution of the transferred "next" processes on the available clients.
To do this, the MSE 110 determines which "next" processes are scheduled to be executed on busy clients. The MSE 110 also determines which clients are available to execute processes. Assuming the MSE 110 determines that one or more clients are available, the MSE sends "process transfer" commands to the busy clients associated with the "next" processes. Each process transfer command received by a busy client directs the busy client to transfer its "next" installed process to an available client identified by a client destination address in the transfer command. Each available destination client has an operating system compatible with the busy client from where the process is being transferred. MSE 110 is able to determine such compatible client transfer pairs based on the OS type information in column 212 of master schedule 112. When the "next" process has been successfully transferred from the busy client to the available client, then the MSE 110 initiates execution of the transferred "next" process on the available client. With reference to FIG. 1 an example cross-platform scheduling scenario is now described. The example scenario includes the following client/process configuration. Client 102a is an Internet, Web-server having a Sun/Solaria Unix based operating system. An Internet information gathering process installed on client 102a (e.g., a Web search engine or crawler) is used to automatically search Internet-web sites for predetermined information, collect "found" information, and send the found information to another computer within the same network. All of this is referred to as "jobl."
In the example scenario, the particular web-information collected by the Internet information gathering process of client 102a is passed to client 102b. Client 102b is a work station operating under the Windows NT OS. A chart generating process installed on client 102b is used to generate bit mapped charts based on the web-information passed to client 102b. The charts are displayed to a user. This is referred to as "job2". The chart generating process of client 102b submits queries to a database application (this is referred to as "job3") residing on client 102c, which is also a Windows NT based client.
In this example scenario, a master schedule 112 is generated to schedule the following conditional executing sequence of processes (i.e., jobl, job2 and iob3): 1. j ob 1 (Execute the information gathering process on client 102a to collect web information and then pass the gathered web information to client 102b);
2. If jobl successful, goto job2 (concurrently execute the chart generating process on client 102b and the database application on client 102c, to generate and display charts),
If jobl unsuccessful, goto jobl (re-execute jobl one time only); and
3. If job2 successful, then DONE, If job2 unsuccessful, then ERROR.
In yet another, example cross-platform scenario, a Unix based client 102a executes the web-based information gatherer (J001) described above, a Unix based client 102b executes a parser to parse the gathered information (jobl), and a Windows NT based client 102c executes an email generator to generate email messages available to a user (j°b3 and job4). The jobs are scheduled to execute according to the following master schedule:
1. jobl (execute the information gatherer);
2. If jobl successful, goto job2 (parse the gathered data); and
3. If job2 successful, goto job3 (generate an email Success message), If jobl unsuccessful, goto job4 (generate an email Error message).
In the above example scenarios, only a single job is scheduled to execute on each distinct client 102. However, in an alternate embodiment of the present invention, master schedule 112 can be constructed such that several jobs are queued for scheduled execution on one or more of clients 102. Example Network Environment
The present invention can be implemented in any communication network, such as, the Internet, which supports interactive services and applications. In particular, the present invention can be implemented in any Web service, preferably a Web service supporting secure transactions, such as, the
Secure Socket Layer (SSL) protocol and/or using a Secure HyperText Transport Protocol (S-HTTP). In one example, the present invention is implemented in a multi-platform (platform independent) programming language such as Java. Java-enabled browsers are used, such as, Netscape, HotJava, and Microsoft Explorer browsers. Active content Web pages can be used. Such active content
Web pages can include Java applets or ActiveX controls, or any other active content technology developed now or in the future. The present invention, however, is not intended to be limited to Java or Java-enabled browsers, and can be implemented in any programming language and browser, developed now or in the future, as would be apparent to a person skilled in the art given this description. Further, the present invention is not intended to be limited to a Web- based implementation or environment and can be implemented in any communication network now or in the future, as would be apparent to a person skilled in the art given this description. Even further, the present invention can operate in the absence of a network, for example, on a computer not connected with a network.
FIG. 5 A is a diagram of an example internetwork environment according to the present invention. FIG. 5A shows a communication network or combination of networks (Internet) 500 (corresponding to communication network 104 of FIG. 1 ) which can support the invention. Internet 500 consists of interconnected computers which supports communication between many different types of users including businesses, universities, individuals, government, and financial institutions. Internet 500 supports mam- different types of communication links implemented in a variety of architectures. For example, voice and data links can be used including phone, paging, cellular, and cable TV (CATV) links. Terminal equipment can include local area networks, personal computers with modems, content servers of multi-media, audio, video, and other information, pocket organizers, personal digital assistants (PDAs), and set-top boxes.
Communication over a communication network such as, Internet 500, is carried out through different layers of communication. FIG. 5B shows a simplified four-layered communication model supporting Web commerce including an application layer 508, transport layer 510, Internet layer 520, physical layer 530. As would be apparent to a person skilled in the art, in practice, a number of different layers can be used depending upon a particular network design and communication application. Application layer 508 represents the different tools and information services which are used to access the information over the Internet. Such tools include, but are not limited to, telenet log-in service 501, IRC chat 502, Web service 503, and SMTP (Simple Mail
Transfer Protocol) electronic mail service 506. Web service 503 allows access to HTTP documents 504, and FTP and Gopher files 505. A Secure Socket Layer (SSL) is an optional protocol used to encrypt communications between a Web browser and Web server. Description of the example environment in these terms is provided for convenience only. It is not intended that the invention be limited to application in this example environment. In fact, after reading the following description, it will become apparent to a person skilled in the relevant art how to implement the invention in alternative environments.
Example Computer System
An example of a computer system 540 is shown in FIG. 5C. The computer system 540 represents any single or multi-processor computer. Single or multi-tasking computers can be used. Unified or distributed memory systems can be used.
Computer system 540 includes one or more processors, such as processor 544. In one embodiment, computer system 540 corresponds to server 108 of FIG. 1, wherein scheduling engine 110 (also referred to as scheduler 110) comprises one or more processors 544 for executing software implemented methods 300 and 400 as described above, and as appropriate. Each processor 544 is connected to a communication infrastructure 542 (e.g., a communications bus, cross-bar, or network). Various software embodiments are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computer systems and/or computer architectures.
Computer system 540 also includes a main memory 546, preferably random access memory (RAM), and can also include a secondary memory 548. The secondary memory 548 can include, for example, a hard disk drive 552 and/or a removable storage drive 552, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive 552 reads from and/or writes to a removable storage unit 554 in a well known manner. Removable storage unit 554 represents a floppy disk, magnetic tape, optical disk, etc., which is read by and written to by removable storage drive 552. As will be appreciated, the removable storage unit 554 includes a computer usable storage medium having stored therein computer software and/or data.
In alternative embodiments, secondary memory 560 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 540. Such means can include, for example, a removable storage unit 562 and an interface 560. Examples can include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 562 and interfaces 560 which allow software and data to be transferred from the removable storage unit 562 to computer system 540. Computer system 540 can also include a communications interface 564. Communications interface 564 allows software and data to be transferred between computer system 540 and external devices via communications path 566. Examples of communications interface 564 can include a modem, a network interface (such as Ethernet card), a communications port, etc. Software and data transferred via communications interface 564 are in the form of signals 568 which can be electronic, electromagnetic, optical or other signals capable of being received by communications interface 564, via communications path 566. Note that communications interface 564 provides a means by which computer system 540 can interface to a network such as the Internet.
The present invention can be implemented using software running (that is, executing) in an environment similar to that described above with respect to FIG. 5A. In this document, the term "computer program product" is used to generally refer to removable storage unit 554, a hard disk installed in hard disk drive 552, or a carrier wave carrying software over a communication path 566
(wireless link or cable) to communication interface 564. A computer useable medium can include magnetic media, optical media, or other recordable media, or media that transmits a carrier wave or other signal. These computer program products are means for providing software to computer system 540. Computer programs (also called computer control logic) are stored in main memoiy 546 and/or secondary memory 548. Computer programs can also be received via communications interface 564. Such computer programs, when executed, enable the computer system 540 to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 544 to perform the features of the present invention, as related to proximity searching. Accordingly, such computer programs represent controllers of the computer system 540.
The present invention can be implemented as control logic in software, firmware, hardware or any combination thereof. In an embodiment where the invention is implemented using software, the software may be stored in a computer program product and loaded into computer system 540 using removable storage drive 552, hard drive 550, or interface 560. Alternatively, the computer program product may be downloaded to computer system 540 . over communications path 566. The control logic (software), when executed by the one or more processors 544, causes the processor(s) 544 to perform the functions of the invention as described herein.
In another embodiment, the invention is implemented primarily in firmware and/or hardware using, for example, hardware components such as application specific integrated circuits (ASICs). Implementation of a hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s).
Conclusion
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the appended claims. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims

What Is Claimed Is:
1. In a system including first and second distinct computers respectively having first and second different operating systems, a cross-platform process scheduling method comprising the step of: scheduling a first process compatible with the first operating system and a second process compatible with the second operating system to respectively execute on the first and second computers.
2. The method of claim 1 , wherein a master schedule includes a first process identifier identifying the first process and a second process identifier identifying the second process, the first and second process identifiers being linked together to define an executing sequence of the first and second processes, the method further comprising the step of scheduling the first and second processes to execute on the respective first and second computers according to the defined executing sequence.
3. The method of claim 2, wherein the master schedule includes one or more conditional inter-relationships between the first and second processes, the method further comprising the step of scheduling the first and second processes to execute based on the one or more conditional inter-relationships.
4. The method of claim 3 , wherein the one or more conditional inter- relationships include a success criteria associated with the first process, the method further comprising the steps of: executing the first process; comparing the success criteria to execution results produced by the first process; and determining whether the first process executed successfully based on the comparison step.
5. The method of claim 4, wherein the master table includes a third process identifier identifying a third process, the method further comprising the alternative steps of: executing the second process when the first process executed successfully according to the determining step, and executing the third process but not the second process when the first process did not execute successfully according to the determining step.
6. The method of claim 5, further comprising the steps of: sending a command to the first computer to initiate execution of the first process on the first computer; receiving a result message from the first computer, the result message including the execution results produced by the first process; and sending a command to the second computer when the first process executed successfully according to the determining step to initiate execution of the second process on the second computer.
7. The method of claim 2, further comprising the step of monitoring processor loading associated with the first and second computers and adjusting the executing sequence based on the processor loading.
8. The method of claim 2, wherein the master table includes a priority associated with each process identifier, the method further comprising the step of adjusting the executing sequence based on the respective priorities associated with the first and second processes.
9. The method of claim 1 , further comprising prior to the scheduling step, the steps of: receiving a first message from the first computer indicating that the first process needs to be scheduled for execution on the first computer; receiving a second message from the second computer indicating that the second process needs to be scheduled for execution on the second computer; and generating the master schedule based on the first and second messages.
10. The method of claim 9, wherein the generating step includes the steps of: receiving one or more commands indicating an executing sequence of the first and second processes; and linking the first and second processes together according to the commands.
11. A system for scheduling the execution of cross-platform computer processes on a plurality of client computers, the plurality of client computers including first and second distinct computers having respective first and second different operating systems, comprising: a process scheduling computer coupled to the first and second computers, the scheduling computer including a scheduler that schedules a first process compatible with the first operating system and a second process compatible with the second operating system to respectively execute on the first and second client computers.
12. The system of claim 11 , further comprising a master schedule that is accessible to the scheduler, the master schedule including a first process identifier identifying the first process and a second process identifier identifying the second process, the first and second process identifiers being linked together to define an executing sequence of the first and second processes, wherein the scheduler schedules the first and second processes to execute on the respective first and second computers according to the defined executing sequence.
13. The system of claim 12, wherein the master schedule includes one or more conditional inter-relationships between the first and second processes, and wherein the scheduler schedules the first and second processes to execute based on the one or more conditional inter-relationships.
14. The system of claim 13 , wherein the one or more conditional interrelationships include a success criteria associated with the first process, and wherein the scheduler includes: means for executing the first process; means for comparing the success criteria to execution results produced by the first process; and means for determining whether the first process executed successfully based on a comparison result produced by the comparing means.
15. The system of claim 14, wherein the master table includes a third process identifier identifying a third process, and wherein the scheduler includes: means for executing the second process when the first process executed successfully according to the determining step; and means for executing the third process but not the second process when the first process did not execute successfully according to the determining step.
16. The system of claim 15, wherein the scheduler further comprises: means for sending a command to the first computer to initiate execution of the first process on the first computer; means for receiving a result message from the first computer, the result message including the execution results produced by the first process; and means for sending a command to the second computer to initiate execution of the second process on the second computer when the determining means determines the first process executed successfully.
17. The system of claim 12, wherein the scheduler comprises means for monitoring a processor loading associated with the first and second computers and adjusting the executing sequence based on the processor loading.
18. The system of claim 12, wherein the master table includes a priority associated with each process identifier, and wherein the scheduler includes means for adjusting the executing sequence based on the respective priorities associated with the first and second processes.
19. The system of claim 11 , wherein the scheduler comprises: means for receiving a first message from the first computer indicating that the first process needs to be scheduled for execution on the first computers; means for receiving a second message from the second computer indicating that the second process needs to be scheduled for execution on the second computer; and means for generating the master schedule based on the first and second messages.
20. The system of claim 19, wherein the generating means includes: means for receiving one or more commands indicating an executing sequence of the first and second processes; and means for linking the first and second processes together according to the commands.
21. In a system including first and second distinct computers respectively having first and second different operating systems, a computer program product comprising computer usable media having computer readable program code means embodied in the media for causing application programs to execute on a computer processor to perform cross-platform computer process scheduling, the computer readable program code means comprising: first computer readable program code means for causing the processor to schedule a first process compatible with the first operating system and a second process compatible with the second operating system to respectively execute on the first and second computers.
22. The computer program product of claim 21. wherein a master schedule includes a first process identifier identifying the first process and a second process identifier identifying the second process, the first and second process identifiers being linked together to define an executing sequence of the first and second processes, the computer program product further comprising a second computer readable program code means for causing the processor to schedule the first and second processes to execute on the respective first and second computers according to the defined executing sequence.
23. The computer program product of claim 22. wherein the master schedule includes one or more conditional inter-relationships between the first and second processes, the computer program product further comprising a third computer readable program code means for causing the processor to schedule the first and second processes to execute based on the one or more conditional interrelationships.
24. The computer program product of claim 23. wherein the one or more conditional inter-relationships include a success criteria associated with the first process, the computer program product further comprising: fourth computer readable program code means for causing the processor to execute the first process; fifth computer readable program code means for causing the processor to compare the success criteria to execution results produced by the first process; and sixth computer readable program code means for causing the processor to determine whether the first process executed successfully based on a result of the compare.
25. The computer program product of claim 24, wherein the master table includes a third process identifier identifying a third process, the computer program product further comprising: seventh computer readable program code means for causing the processor to execute the second process when the first process executed successfully; and eighth computer readable program code means for causing the processor to execute the third process but not the second process when the first process did not execute successfully.
26. The computer program product of claim 25, further comprising: ninth computer readable program code means for causing the processor to send a command to the first computer to initiate execution of the first process on the first computer; tenth computer readable program code means for causing the processor to receive a result message from the first computer, the result message including the execution results produced by the first process; and eleventh computer readable program code means for causing the processor to send a command to the second computer to initiate execution of the second process on the second computer when it is determined that the first process executed successfully.
PCT/US2001/013138 2000-04-25 2001-04-25 System and method for scheduling execution of cross-platform computer processes WO2001082075A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2001255611A AU2001255611A1 (en) 2000-04-25 2001-04-25 System and method for scheduling execution of cross-platform computer processes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US19940100P 2000-04-25 2000-04-25
US60/199,401 2000-04-25

Publications (2)

Publication Number Publication Date
WO2001082075A2 true WO2001082075A2 (en) 2001-11-01
WO2001082075A3 WO2001082075A3 (en) 2002-09-12

Family

ID=22737342

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/013138 WO2001082075A2 (en) 2000-04-25 2001-04-25 System and method for scheduling execution of cross-platform computer processes

Country Status (3)

Country Link
US (2) US7469405B2 (en)
AU (1) AU2001255611A1 (en)
WO (1) WO2001082075A2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004029805A2 (en) * 2002-09-30 2004-04-08 International Business Machines Corporation A common scheduler web service for distributed network environments
WO2006061773A2 (en) * 2004-12-08 2006-06-15 Koninklijke Philips Electronics N.V. A method and system for providing access to active objects
US10338970B2 (en) 2016-09-20 2019-07-02 International Business Machines Corporation Multi-platform scheduler for permanent and transient applications

Families Citing this family (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001080065A2 (en) * 2000-04-18 2001-10-25 Icplanet Acquisition Corporation Method, system, and computer program product for propagating remotely configurable posters of host site content
US6578022B1 (en) 2000-04-18 2003-06-10 Icplanet Corporation Interactive intelligent searching with executable suggestions
US6681255B1 (en) 2000-04-19 2004-01-20 Icplanet Corporation Regulating rates of requests by a spider engine to web sites by creating instances of a timing module
WO2001082112A2 (en) * 2000-04-25 2001-11-01 Icplanet Acquisition Corporation System and method related to generating and tracking an email campaign
AU2001259143A1 (en) * 2000-04-25 2001-11-07 Icplanet Acquisition Corporation Method, system, and computer program product for employment market statistics generation and analysis
AU2001255611A1 (en) 2000-04-25 2001-11-07 Icplanet Acquisition Corporation System and method for scheduling execution of cross-platform computer processes
US7007010B2 (en) * 2000-04-25 2006-02-28 Icplanet Corporation System and method for proximity searching position information using a proximity parameter
TW511006B (en) * 2000-10-13 2002-11-21 Oce Tech Bv Distributed document handling system
US6748402B1 (en) * 2001-04-02 2004-06-08 Bellsouth Intellectual Property Corporation System and method for converting and loading interactive pager address books
FR2829330B1 (en) * 2001-08-31 2003-11-28 Canon Kk METHOD FOR REQUESTING RECEIPT OF THE RESULT OF EXECUTION OF A REMOTE FUNCTION ON A PREDETERMINED DATE
GB0123861D0 (en) * 2001-10-04 2001-11-28 Marconi Comm Ltd Comunications networks
JP3938343B2 (en) * 2002-08-09 2007-06-27 インターナショナル・ビジネス・マシーンズ・コーポレーション Task management system, program, and control method
EP2339469A1 (en) * 2004-03-13 2011-06-29 Adaptive Computing Enterprises, Inc. System and method for a self-optimizing reservation in time of compute resources
CA2827035A1 (en) 2004-11-08 2006-05-18 Adaptive Computing Enterprises, Inc. System and method of providing system jobs within a compute environment
US9075657B2 (en) 2005-04-07 2015-07-07 Adaptive Computing Enterprises, Inc. On-demand access to compute resources
US9231886B2 (en) 2005-03-16 2016-01-05 Adaptive Computing Enterprises, Inc. Simple integration of an on-demand compute environment
US8166469B2 (en) 2007-08-20 2012-04-24 Red Hat, Inc. Method and an apparatus to conduct software release
US20090089777A1 (en) * 2007-09-29 2009-04-02 Bruce Gordon Fuller Managing software updates in an automation environment
US9417914B2 (en) * 2008-06-02 2016-08-16 Microsoft Technology Licensing, Llc Regaining control of a processing resource that executes an external execution context
US8793652B2 (en) * 2012-06-07 2014-07-29 International Business Machines Corporation Designing and cross-configuring software
US8156212B2 (en) 2009-06-16 2012-04-10 JumpSoft, Inc. Method, system and apparatus for managing computer processes
US11720290B2 (en) 2009-10-30 2023-08-08 Iii Holdings 2, Llc Memcached server functionality in a cluster of data processing nodes
US8949835B2 (en) * 2010-11-30 2015-02-03 Red Hat, Inc. Yielding input/output scheduler to increase overall system throughput
US8850450B2 (en) 2012-01-18 2014-09-30 International Business Machines Corporation Warning track interruption facility
US9104508B2 (en) * 2012-01-18 2015-08-11 International Business Machines Corporation Providing by one program to another program access to a warning track facility
US9110878B2 (en) 2012-01-18 2015-08-18 International Business Machines Corporation Use of a warning track interruption facility by a program
EP2682905A1 (en) * 2012-07-05 2014-01-08 Siemens Aktiengesellschaft Method and system for handling conditional dependencies between alternative product segments within a manufacturing execution system ANSI/ISA/95 compliant.
US9886306B2 (en) 2014-11-21 2018-02-06 International Business Machines Corporation Cross-platform scheduling with long-term fairness and platform-specific optimization
US10261837B2 (en) 2017-06-30 2019-04-16 Sas Institute Inc. Two-part job scheduling with capacity constraints and preferences
JP6806019B2 (en) * 2017-09-26 2020-12-23 オムロン株式会社 Control device
US10310896B1 (en) 2018-03-15 2019-06-04 Sas Institute Inc. Techniques for job flow processing

Family Cites Families (145)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5107443A (en) * 1988-09-07 1992-04-21 Xerox Corporation Private regions within a shared workspace
US5164897A (en) 1989-06-21 1992-11-17 Techpower, Inc. Automated method for selecting personnel matched to job criteria
JPH03188528A (en) * 1989-09-27 1991-08-16 Hitachi Ltd Method and system for job execution management
US5265033A (en) 1991-09-23 1993-11-23 Atm Communications International, Inc. ATM/POS based electronic mail system
US5414845A (en) * 1992-06-26 1995-05-09 International Business Machines Corporation Network-based computer system with improved network scheduling system
EP0746816B1 (en) * 1993-08-03 2001-10-24 Sun Microsystems, Inc. Flexible multi-platform partitioning for computer applications
US5532838A (en) * 1993-12-27 1996-07-02 Barbari; Edward P. Method & apparatus for dynamically creating and transmitting documents via facsimile equipment
JPH07200509A (en) * 1993-12-28 1995-08-04 Nec Corp Automatic program allotment system
US6625581B1 (en) 1994-04-22 2003-09-23 Ipf, Inc. Method of and system for enabling the access of consumer product related information and the purchase of consumer products at points of consumer presence on the world wide web (www) at which consumer product information request (cpir) enabling servlet tags are embedded within html-encoded documents
US20020004753A1 (en) 1996-10-25 2002-01-10 Thomas J. Perkowski System and method for finding and serving consumer product related information to consumers using internet-based information servers and clients
KR100289826B1 (en) * 1994-05-31 2001-05-15 아끼구사 나오유끼 Job execution system and method between different operating systems
US5543789A (en) 1994-06-24 1996-08-06 Shields Enterprises, Inc. Computerized navigation system
JPH0830471A (en) * 1994-07-14 1996-02-02 Hitachi Ltd Execution processor change system for job
US5551024A (en) * 1994-10-13 1996-08-27 Microsoft Corporation System for identifying data records in a database using a data structure with linked parameters in a search range
DE69531188T2 (en) 1994-12-28 2004-04-22 Aisin AW Co., Ltd., Anjo navigation device
US5799309A (en) * 1994-12-29 1998-08-25 International Business Machines Corporation Generating an optimized set of relational queries fetching data in an object-relational database
US5583995A (en) 1995-01-30 1996-12-10 Mrj, Inc. Apparatus and method for data storage and retrieval using bandwidth allocation
JPH08221479A (en) * 1995-02-17 1996-08-30 Nippondenso Co Ltd Job shop plant scheduler
US5870552A (en) 1995-03-28 1999-02-09 America Online, Inc. Method and apparatus for publishing hypermedia documents over wide area networks
US5937162A (en) * 1995-04-06 1999-08-10 Exactis.Com, Inc. Method and apparatus for high volume e-mail delivery
US5832497A (en) 1995-08-10 1998-11-03 Tmp Worldwide Inc. Electronic automated information exchange and management system
GB9516762D0 (en) 1995-08-16 1995-10-18 Phelan Sean P Computer system for identifying local resources
KR0183524B1 (en) * 1995-09-27 1999-04-15 모리 하루오 Navigation system for displaying a structure-shape map 51 g08g 1/0969
US5966695A (en) 1995-10-17 1999-10-12 Citibank, N.A. Sales and marketing support system using a graphical query prospect database
JP3743037B2 (en) * 1995-11-01 2006-02-08 株式会社日立製作所 Information providing method to mobile terminal, information providing system, and mobile terminal
US5781901A (en) * 1995-12-21 1998-07-14 Intel Corporation Transmitting electronic mail attachment over a network using a e-mail page
GB9602027D0 (en) * 1996-02-01 1996-04-03 Madge Networks Ltd Flow control in a cell switched communication system
US5706502A (en) * 1996-03-25 1998-01-06 Sun Microsystems, Inc. Internet-enabled portfolio manager system and method
US6188396B1 (en) * 1996-03-29 2001-02-13 International Business Machines Corp. Synchronizing multimedia parts with reference to absolute time, relative time, and event time
US6311211B1 (en) 1996-04-19 2001-10-30 Juno Online Services, Inc. Method and apparatus for delivering electronic advocacy messages
TW317058B (en) * 1996-04-23 1997-10-01 Ibm Data communication system for a wireless access to an atm network
US5999912A (en) 1996-05-01 1999-12-07 Wodarz; Dennis Dynamic advertising scheduling, display, and tracking
US5793972A (en) * 1996-05-03 1998-08-11 Westminster International Computers Inc. System and method providing an interactive response to direct mail by creating personalized web page based on URL provided on mail piece
US5923848A (en) 1996-05-31 1999-07-13 Microsoft Corporation System and method for resolving names in an electronic messaging environment
US5818447A (en) 1996-06-06 1998-10-06 Microsoft Corporation System and method for in-place editing of an electronic mail message using a separate program
US6031533A (en) * 1996-07-03 2000-02-29 Sun Microsystems, Inc. Graphical user interface for use in a de-centralized network environment
US5933811A (en) 1996-08-20 1999-08-03 Paul D. Angles System and method for delivering customized advertisements within interactive communication systems
US20040139049A1 (en) 1996-08-22 2004-07-15 Wgrs Licensing Company, Llc Unified geographic database and method of creating, maintaining and using the same
AU5156898A (en) 1996-11-07 1998-05-29 Vayu Web, Inc. System and method for displaying information and monitoring communications over the internet
WO1998027696A1 (en) 1996-12-05 1998-06-25 3Com Corporation Method and apparatus for time-based download control
US5875175A (en) * 1997-05-01 1999-02-23 3Com Corporation Method and apparatus for time-based download control
US7287271B1 (en) 1997-04-08 2007-10-23 Visto Corporation System and method for enabling secure access to services in a computer network
US6263020B1 (en) 1996-12-24 2001-07-17 Intel Corporation Method and apparatus for bit rate control in a digital video system
US6222825B1 (en) 1997-01-23 2001-04-24 Advanced Micro Devices, Inc. Arrangement for determining link latency for maintaining flow control in full-duplex networks
US5978799A (en) 1997-01-30 1999-11-02 Hirsch; G. Scott Search engine including query database, user profile database, information templates and email facility
AUPO525497A0 (en) 1997-02-21 1997-03-20 Mills, Dudley John Network-based classified information systems
US6085244A (en) * 1997-03-17 2000-07-04 Sun Microsystems, Inc. Dynamic test update in a remote computer monitoring system
JP3002721B2 (en) * 1997-03-17 2000-01-24 警察庁長官 Graphic position detecting method and apparatus, and machine-readable recording medium storing program
US5796952A (en) * 1997-03-21 1998-08-18 Dot Com Development, Inc. Method and apparatus for tracking client interaction with a network resource and creating client profiles and resource database
US6009462A (en) 1997-06-16 1999-12-28 Digital Equipment Corporation Replacing large bit component of electronic mail (e-mail) message with hot-link in distributed computer system
US6829764B1 (en) * 1997-06-23 2004-12-07 International Business Machines Corporation System and method for maximizing usage of computer resources in scheduling of application tasks
US7194424B2 (en) 1997-06-25 2007-03-20 Intel Corporation User demographic profile driven advertising targeting
US20010011226A1 (en) 1997-06-25 2001-08-02 Paul Greer User demographic profile driven advertising targeting
US6256627B1 (en) * 1997-07-08 2001-07-03 At&T Corp. System and method for maintaining a knowledge base and evidence set
US6701372B2 (en) 1997-08-22 2004-03-02 Canon Kabushiki Kaisha Data communication apparatus and method
US6049776A (en) * 1997-09-06 2000-04-11 Unisys Corporation Human resource management system for staffing projects
US6182129B1 (en) * 1997-09-11 2001-01-30 International Business Machines Corporation Apparatus, methods and computer program products for managing sessions with host-based application using session vectors
US6091777A (en) * 1997-09-18 2000-07-18 Cubic Video Technologies, Inc. Continuously adaptive digital video compression system and method for a web streamer
US6055510A (en) 1997-10-24 2000-04-25 At&T Corp. Method for performing targeted marketing over a large computer network
US6021406A (en) * 1997-11-14 2000-02-01 Etak, Inc. Method for storing map data in a database using space filling curves and a method of searching the database to find objects in a given area and to find objects nearest to a location
JP3927304B2 (en) 1998-02-13 2007-06-06 トヨタ自動車株式会社 Map data access method for navigation
US6170011B1 (en) 1998-09-11 2001-01-02 Genesys Telecommunications Laboratories, Inc. Method and apparatus for determining and initiating interaction directionality within a multimedia communication center
US6791943B1 (en) 1998-02-27 2004-09-14 Agilent Technologies, Inc. Event-based technique for determining instantaneous cell bandwidth in a digital communications network
US6101485A (en) 1998-03-26 2000-08-08 International Business Machines Corporation Electronic solicitations for internet commerce
US6009455A (en) * 1998-04-20 1999-12-28 Doyle; John F. Distributed computation utilizing idle networked computers
US6070190A (en) * 1998-05-11 2000-05-30 International Business Machines Corporation Client-based application availability and response monitoring and reporting for distributed computing environments
US6748451B2 (en) * 1998-05-26 2004-06-08 Dow Global Technologies Inc. Distributed computing environment using real-time scheduling logic and time deterministic architecture
US6006225A (en) 1998-06-15 1999-12-21 Amazon.Com Refining search queries by the suggestion of correlated terms from prior searches
US6353845B1 (en) * 1998-06-25 2002-03-05 International Business Machines Corporation Computer system, program product and method for tracking asynchronous I/O with timeout support
JP2000020421A (en) 1998-07-01 2000-01-21 Hitachi Software Eng Co Ltd Method for automatically selecting template in electronic mail system
US6539080B1 (en) 1998-07-14 2003-03-25 Ameritech Corporation Method and system for providing quick directions
US7047423B1 (en) * 1998-07-21 2006-05-16 Computer Associates Think, Inc. Information security analysis system
US6170071B1 (en) * 1998-07-27 2001-01-02 Lucent Technologies, Inc. Method for optimizing test fixtures to minimize vector load time for automated test equipment
US6363377B1 (en) * 1998-07-30 2002-03-26 Sarnoff Corporation Search data processor
AU5234999A (en) 1998-08-03 2000-02-28 Doubleclick Inc. Network for distribution of re-targeted advertising
US6360254B1 (en) 1998-09-15 2002-03-19 Amazon.Com Holdings, Inc. System and method for providing secure URL-based access to private resources
US6854007B1 (en) 1998-09-17 2005-02-08 Micron Technology, Inc. Method and system for enhancing reliability of communication with electronic messages
JP2000112883A (en) 1998-09-24 2000-04-21 Internatl Business Mach Corp <Ibm> Method for processing information, information processor, and storage medium storing information processing program
US20010042000A1 (en) 1998-11-09 2001-11-15 William Defoor Method for matching job candidates with employers
US6578002B1 (en) * 1998-11-25 2003-06-10 Gregory John Derzay Medical diagnostic system service platform
US6618747B1 (en) 1998-11-25 2003-09-09 Francis H. Flynn Electronic communication delivery confirmation and verification system
US6381579B1 (en) * 1998-12-23 2002-04-30 International Business Machines Corporation System and method to provide secure navigation to resources on the internet
US6751606B1 (en) 1998-12-23 2004-06-15 Microsoft Corporation System for enhancing a query interface
US6721759B1 (en) * 1998-12-24 2004-04-13 Sony Corporation Techniques for spatial representation of data and browsing based on similarity
US20010016730A1 (en) * 1999-02-17 2001-08-23 Harold M. Martins Apparatus for the dialysis of blood, method for fabricating the same, and method for the dialysis of blood
US6282540B1 (en) 1999-02-26 2001-08-28 Vicinity Corporation Method and apparatus for efficient proximity searching
JP2000293099A (en) * 1999-04-09 2000-10-20 Toyota Motor Corp Map database
US6449635B1 (en) 1999-04-21 2002-09-10 Mindarrow Systems, Inc. Electronic mail deployment system
US6560243B1 (en) 1999-04-30 2003-05-06 Hewlett-Packard Development Company System and method for receiver based allocation of network bandwidth
US6188398B1 (en) * 1999-06-02 2001-02-13 Mark Collins-Rector Targeting advertising using web pages with video
US6606613B1 (en) * 1999-06-03 2003-08-12 Microsoft Corporation Methods and apparatus for using task models to help computer users complete tasks
US6188096B1 (en) 1999-06-09 2001-02-13 International Business Machines Corporation DRAM cell capacitor having increased trench capacitance
US6668281B1 (en) 1999-06-10 2003-12-23 General Interactive, Inc. Relationship management system and method using asynchronous electronic messaging
US7072888B1 (en) * 1999-06-16 2006-07-04 Triogo, Inc. Process for improving search engine efficiency using feedback
US6446111B1 (en) 1999-06-18 2002-09-03 Epicrealm Operating Inc. Method and apparatus for client-server communication using a limited capability client over a low-speed communications link
US6662194B1 (en) 1999-07-31 2003-12-09 Raymond Anthony Joao Apparatus and method for providing recruitment information
US6289340B1 (en) 1999-08-03 2001-09-11 Ixmatch, Inc. Consultant matching system and method for selecting candidates from a candidate pool by adjusting skill values
US6766348B1 (en) * 1999-08-03 2004-07-20 Worldcom, Inc. Method and system for load-balanced data exchange in distributed network-based resource allocation
AU6635000A (en) 1999-08-12 2001-03-13 Kivera, Inc. Method and apparatus for providing location-dependent services to mobile users
US6606660B1 (en) * 1999-08-31 2003-08-12 Accenture Llp Stream-based communication in a communication services patterns environment
JP2001067594A (en) 1999-08-31 2001-03-16 Hitachi Ltd Broadcast method, broadcast device, traffic information compiling device and traffic information display system
US7149893B1 (en) 1999-09-07 2006-12-12 Poofaway.Com, Inc. System and method for enabling the originator of an electronic mail message to preset an expiration time, date, and/or event, and to control processing or handling by a recipient
JP3875817B2 (en) 1999-09-27 2007-01-31 ペンタックス株式会社 Map coordinate detection system for ranging device
JP2001124568A (en) 1999-10-29 2001-05-11 Pioneer Electronic Corp Apparatus and method for displaying map
US6321265B1 (en) 1999-11-02 2001-11-20 Altavista Company System and method for enforcing politeness while scheduling downloads in a web crawler
US6351755B1 (en) 1999-11-02 2002-02-26 Alta Vista Company System and method for associating an extensible set of data with documents downloaded by a web crawler
US6836792B1 (en) * 1999-12-03 2004-12-28 Trend Micro Incorporated Techniques for providing add-on services for an email system
US20020073343A1 (en) 1999-12-14 2002-06-13 Ziskind Benjamin H. Integrated internet messenger system and method
US20010039508A1 (en) 1999-12-16 2001-11-08 Nagler Matthew Gordon Method and apparatus for scoring and matching attributes of a seller to project or job profiles of a buyer
US7475346B1 (en) * 1999-12-22 2009-01-06 Unisys Corporation System and method for providing a customizable web portal service
US6275575B1 (en) * 2000-01-12 2001-08-14 Right4Me.Com, Inc. Method and system for coordinating and initiating cross-platform telephone conferences
US6778973B2 (en) 2000-01-12 2004-08-17 Duane Harlan Method for selection of events based on proximity
US6401075B1 (en) 2000-02-14 2002-06-04 Global Network, Inc. Methods of placing, purchasing and monitoring internet advertising
US20010047297A1 (en) 2000-02-16 2001-11-29 Albert Wen Advertisement brokering with remote ad generation system and method in a distributed computer network
US6408260B1 (en) * 2000-02-16 2002-06-18 Cymer, Inc. Laser lithography quality alarm system
AUPQ599700A0 (en) 2000-03-03 2000-03-23 Super Internet Site System Pty Ltd On-line geographical directory
US6727927B1 (en) * 2000-03-08 2004-04-27 Accenture Llp System, method and article of manufacture for a user interface for a knowledge management tool
US6587832B1 (en) 2000-03-16 2003-07-01 Compensate.Com Llc Market pay system
US6785679B1 (en) 2000-03-29 2004-08-31 Brassring, Llc Method and apparatus for sending and tracking resume data sent via URL
US7103580B1 (en) 2000-03-30 2006-09-05 Voxage, Ltd. Negotiation using intelligent agents
WO2001080065A2 (en) 2000-04-18 2001-10-25 Icplanet Acquisition Corporation Method, system, and computer program product for propagating remotely configurable posters of host site content
US6578022B1 (en) 2000-04-18 2003-06-10 Icplanet Corporation Interactive intelligent searching with executable suggestions
US6681255B1 (en) 2000-04-19 2004-01-20 Icplanet Corporation Regulating rates of requests by a spider engine to web sites by creating instances of a timing module
WO2001082112A2 (en) 2000-04-25 2001-11-01 Icplanet Acquisition Corporation System and method related to generating and tracking an email campaign
AU2001259143A1 (en) 2000-04-25 2001-11-07 Icplanet Acquisition Corporation Method, system, and computer program product for employment market statistics generation and analysis
US7007010B2 (en) 2000-04-25 2006-02-28 Icplanet Corporation System and method for proximity searching position information using a proximity parameter
AU2001255611A1 (en) 2000-04-25 2001-11-07 Icplanet Acquisition Corporation System and method for scheduling execution of cross-platform computer processes
WO2001086555A2 (en) 2000-05-05 2001-11-15 L90, Inc. Method and apparatus for transaction tracking over a computer network
US6829780B2 (en) 2000-07-17 2004-12-07 International Business Machines Corporation System and method for dynamically optimizing a banner advertisement to counter competing advertisements
US6523021B1 (en) 2000-07-31 2003-02-18 Microsoft Corporation Business directory search engine
US6594666B1 (en) 2000-09-25 2003-07-15 Oracle International Corp. Location aware application development framework
US20020103698A1 (en) 2000-10-31 2002-08-01 Christian Cantrell System and method for enabling user control of online advertising campaigns
US7383355B1 (en) * 2000-11-01 2008-06-03 Sun Microsystems, Inc. Systems and methods for providing centralized management of heterogeneous distributed enterprise application integration objects
US20050171863A1 (en) 2000-12-15 2005-08-04 Hagen Philip A. System and computerized method for classified ads
US7099872B2 (en) 2001-02-05 2006-08-29 Employon Nj, Llc Method for providing access to online employment information
US6694353B2 (en) 2001-03-28 2004-02-17 Good Contacts.Com Method and system for automatically updating electronic mail address information within an electronic mail address database
US20020152238A1 (en) 2001-04-17 2002-10-17 Hayes Todd R. System and method to provide information corresponding to hyperlinked text in an online HTML document
US20030046148A1 (en) 2001-06-08 2003-03-06 Steven Rizzi System and method of providing advertising on the internet
US20020156779A1 (en) 2001-09-28 2002-10-24 Elliott Margaret E. Internet search engine
US20030128297A1 (en) 2002-01-04 2003-07-10 Kinpo Electronics, Inc. Device for dividing and shifting TV picture and its operating method
US7539756B2 (en) 2002-01-31 2009-05-26 Darby & Mohaine, L.L.C. Method and system of data packet transmission timing for controlling bandwidth
US6758679B2 (en) * 2002-04-17 2004-07-06 Hewlett-Packard Development Company, L.P. Installation instruction conveying device (electronic components) mechanical
US20040220821A1 (en) 2003-04-30 2004-11-04 Ericsson Arthur Dale Bidding method for time-sensitive offerings
CN101253524A (en) 2004-05-18 2008-08-27 艾德沃泰兴.Com公司 Systems and methods of achieving optimal advertising
US7740008B2 (en) * 2007-10-23 2010-06-22 International Engine Intellectual Property Company, Llc Multiple height fluid mixer and method of use

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"MENTAL RAY SPECIFICATIONS" , [Online] pages 1-4, XP002195542 Retrieved from the Internet: <URL:http://www.id8media.com/3d_products/m ental_ray2.htm> [retrieved on 2002-04-08] *
JU J., WANG Y. ET AL: "SCHEDULING PVM TASKS" OPERATING SYSTEMS REVIEW (SIGOPS), ACM HEADQUARTER, NEW YORK, US, vol. 30, no. 3, 1 July 1996 (1996-07-01), pages 22-31, XP000627434 *
TAYLOR, A.: "PRESS RELEASE - AVID ANNOUNCES NEW RELEASE OF SOFTIMAGE 3D 3.8SP2" , [Online] 6 July 1999 (1999-07-06), pages 1-2, XP002195543 Retrieved from the Internet: <URL:http://www.softimage.com/community/xs i/discuss/Archives/3dgames.archive.9907/ms g00000.htm> [retrieved on 2002-04-08] *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004029805A2 (en) * 2002-09-30 2004-04-08 International Business Machines Corporation A common scheduler web service for distributed network environments
WO2004029805A3 (en) * 2002-09-30 2005-06-16 Ibm A common scheduler web service for distributed network environments
WO2006061773A2 (en) * 2004-12-08 2006-06-15 Koninklijke Philips Electronics N.V. A method and system for providing access to active objects
WO2006061773A3 (en) * 2004-12-08 2006-09-21 Koninkl Philips Electronics Nv A method and system for providing access to active objects
US10338970B2 (en) 2016-09-20 2019-07-02 International Business Machines Corporation Multi-platform scheduler for permanent and transient applications

Also Published As

Publication number Publication date
US7469405B2 (en) 2008-12-23
US20090094541A1 (en) 2009-04-09
AU2001255611A1 (en) 2001-11-07
WO2001082075A3 (en) 2002-09-12
US20020016809A1 (en) 2002-02-07
US8156499B2 (en) 2012-04-10

Similar Documents

Publication Publication Date Title
US8156499B2 (en) Methods, systems and articles of manufacture for scheduling execution of programs on computers having different operating systems
US7289966B2 (en) Method and system for adapting the execution of a workflow route
US8326914B2 (en) Network system extensible by users
US6219692B1 (en) Method and system for efficiently disbursing requests among a tiered hierarchy of service providers
CN102880503B (en) Data analysis system and data analysis method
CN101097527B (en) Flowpath scheduling method and system of application progress
US6223202B1 (en) Virtual machine pooling
US7174361B1 (en) Scripting task-level user-interfaces
US5528503A (en) Integrated automation development system and method
US20030131285A1 (en) Automated system that tests software on multiple computers
US20100005472A1 (en) Task decomposition with throttled message processing in a heterogeneous environment
US20030043178A1 (en) Initiation of interactive support from a computer desktop
US20070192415A1 (en) Extensible interface for inter-module communication
JPH09218860A (en) Method for handling remote procedure calling in accordance with various kinds of protocols in client/ server system
US6901425B1 (en) Computer apparatus and method including a disconnect mechanism for communicating between software applications and computers on the world-wide web
GB2304944A (en) Support for application programs in a distributed environment
WO2003032124A2 (en) System and method for managing service interactions
US20120215581A1 (en) Ad-Hoc and Priority-Based Business Process Execution
US20060085461A1 (en) System &amp; method for using web based applications to manipulate data with manipulation functions
US11799804B2 (en) Chat bot control device, chat bot control method, and chat bot control device system
CN112395736A (en) Parallel simulation job scheduling method of distributed interactive simulation system
CN1574750A (en) System supporting communication between a web enabled application and another application
JPH10333925A (en) Autonomous agent architecture
US10740085B2 (en) Webserver interface for deployment management tool
US20030212587A1 (en) Apparatus and methods for coordinating Web services using role based interpretation of coordination plans

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP