CA1292324C - Multitask subscription data retrieval system - Google Patents

Multitask subscription data retrieval system

Info

Publication number
CA1292324C
CA1292324C CA000544996A CA544996A CA1292324C CA 1292324 C CA1292324 C CA 1292324C CA 000544996 A CA000544996 A CA 000544996A CA 544996 A CA544996 A CA 544996A CA 1292324 C CA1292324 C CA 1292324C
Authority
CA
Canada
Prior art keywords
data
user
task
provider
tasks
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Lifetime
Application number
CA000544996A
Other languages
French (fr)
Inventor
Charley B. Cross
Diana Y. Moy
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ricos International Inc
Original Assignee
Wang Laboratories Inc
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
Application filed by Wang Laboratories Inc filed Critical Wang Laboratories Inc
Application granted granted Critical
Publication of CA1292324C publication Critical patent/CA1292324C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • 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/54Interprogram communication
    • G06F9/542Event management; Broadcasting; Multicasting; Notifications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1804Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for stock exchange and similar applications

Abstract

MULTITASK SUBSCRIPTION DATA RETRIEVAL SYSTEM
Abstract of the Disclosure A multitask multiuser system provides for efficient transfer of data from a remote data base to individual subscribers and has particular utility in the distribution of stock market data. A primary provider distributes the incoming data directly to user tasks or to an inquiry provider or a monitor provider. The inquiry provider responds to specific inquiries by users for information in the data base.
The monitor provider maintains lists of information which are being monitored by the host computer for individual users. The inquiry provider and the monitor provider do not repeat requests to the remote data base where a similar request is already pending from another user. Data transfer paths between tasks are established by a code module which may be linked to any of the tasks. The transfer paths are established using information from a configuration list and they are monitored by the operating system through a wait list established for each user task. Providers in the system may establish subscriber lists through the code module.

Description

~;~9~3~4 MULTITASK SUBSCRIPTION DATA RETRIEVAL SYSTEM

Background of the Invention Local computers are akle to gain access to large volumes of information by communicating over telephone lines with remote data bases. The remote data base has storage capabilities which far exceed that which would be feasible at most local computers and can serve as a central storehouse of infor-mation.
A data base that was developed by the Walsh, Greenwood Information Systems, Inc. and which is now maintained by Wang Financial Information Services Corporation is dedicated to information relating to the stock market and other financial institutions.
It contains real time trade and quote information including over~the-counter, option, commodity, futures, and fixed income data, as well as news and institutional holdings. The data base allows a subscribing computer to have access to three general classes of service: broadcast, inquiry and monitoring.
The broadcast class is that in which information is simply broadcast continuously to the user. An example is the New York Stock Exchange ticker service in which all transactions which occur on the New York Stock Exchange are transmitted to all subscibers as those transactions occur. Other broadcast services include a news headlines service which scrolls through headlines received ~rom the Dow Jones News Service and the Reuters News Service.

~Z~23~

Also, the full news items from the Dow Jones News Servlce and the Reuters New Service are transmitted to subscribers to allow for scrolling through the news items as they are released.
Subcribers to the data base are also able to make specific inquiries. For example, a subscriber may send a request for a quotation on any stock item and promptly receive the current information stored at the data base or that stock item. News items of interest may also be retrieved by making requests which include specific identifier symbols which identify the information of interest.
Finally, a subcriber may request that the remote data base monitor all of the in~ormation which enters the data base and transmit only that data which is of particular interest to the sub-scriberO Again, the subscriber transmits a request to the data base which includes identifier symbols.
The Walsh Greenwood Information Sy6tems system was designed for communication with personal comput-ers; hence for each communications line address there has been exactly one user. Each personal computer could subscribe to a particular set of services and pay the appropriate fee for those services. Configuration and security were handled by the network host processor sending a m~ssage to each computer on each line to indicate Which services the network would allow that computer to use. This provided adequate control to permit accurate billing and accounting.

~2~;23~

Disclosure of the Invention Multiple user systems may have multiple terminals connected through a central computer and a single communication line to the data base host computer. Different users in this local system may subscribe to different services. In that situation, the remote data base must maintain accurate files for each of the terminals. Further, the remote data base must transmit data to all subscribing terminals along a single communications line and rely on the local multiuser system to properly distribute the data to those terminals which have subscribed and which have made specific inquiries. It is to s~ch a multiuser system that the present invention is directed.
To properly distribute incoming data to multi-ple users, the local multiuser system must maintain subscription records and records of specific re-quests and must multiplex the incoming data to the individual users. This significant task must be performed without introducing unacceptable delays in transfer of the information from the remote data base to the individual users. The avoidance of delays is particularly critical in ~he case of stock market information. To provide for this rapid dis-tribution of information, one feature of the presen~
invention is in the handling of different classes of information. Tracking of specific monitoring requests from multiple users can become cumbersome.
In accordance with one feature of the present in~
vention, a first provider task divides the incoming 3~Z~;~32~

data stream from the remote data base into plural data streams according to the data type corres-ponding to each service. Selected data streams which are in response to nonmonitoring requests are transferred directly to user tasks subscribiny to the data streams. A data stream which is in response to a specific monitoring request is, however, transferred to a second provider task.
That second provider task then divides the data stream in response to the speci~ic monitoring requests into further data streams and transfers the further data streams to the user tasks. Thus, data which is simply broadcast to the user or which is the result of a specific inquiry need not be delayed by a task which must also handle the more time-consuming distribution of data in response to monitoring request6. The second provider task may also provide the decoding necessary for a particular class of data.
Specific inquiries such as news retrievals may be handled by yet another provider task. Although that class of data does not require the extensive processing of data based on monitoring requests, the data may require sufficient additional processing to warrant a separate task. However, it is pre~erred that quotation inquiries be handled by the first provider task. Users are typically concerned with obtaining very rapid responses to quotation inquiries and handling of such inquires by the first provider task is not too burdensome.

~2~23Z~

Information received from data bases must typically be displayed in a particular format estaklished by the remote data base or by local software provided to all subscribers. Access to the received data by programs developed by the user has typically been limited and, where available, access has required particular programming expertise and effort. Such access has not been available on a real time basis. A further feature of the present invention is that data paths between the provider task and the user task are established by means of a common code module which is linked to each user task. Each data path is specific to a type o~ data transferred to a single user. The commonlcode module simplifies access to the different data types to which the user has subscribed and also~insulates the user program from changes in th~ operating system of the multitask system. Any programming changes required by changes in the operating system can be handled for all programs by modifying the common code module. By establishing a distinct data path for each type of data transferred to each user, local subscriptions can be readily entered and terminated for specific services and the user program can at any point limit its access to a particular service. Thus, the internal message traffic can be minimized.
The time during which a user program must be active while waiting for data from the data base can be minimized by establishing a wait list which is monitored by the operating system. The wait list 32~

includes a mailbox address for each type of data for each user task. Through that mailbox, the operating system notifies the user task of data being transferred to the ~ask. The operating system speeds the distribution of data because :it is not necessary for each program to independently cycle through wait routines. Rather, the operating sytem waits for multiple events simulataneously and then~
deals with whichever one occurs first. Such capa-bilities are not generally available to programmers writing in higher level languages and are made available in the present system hy the common code module.
In establishing the data paths betweèn providers and subscribers, a configuration list may be established for each user task from a config-uration file. Each configuration list includes the name of a provider task mailbox to which requests for each type of data are to be transferred and an indication of whether the task has access to a particular type of data. Each configuration list may also indicate whether the task is a provider of data to other tasks. Provider specific routines of the common code module are limited to provider tasks~ I
The common code module may also be used to establish wait lists for provider tasks. ~A provider task need not repeatedly check whether requests are being made from user tasks, but the operating system may simply monitor the provider task mailbox for each service~ A configuration list would also be generated for each provider task so that the provider task would be able to identify each mailbox relative to each service. To facilitate distri bution of data to subscribers, each provider may establish a subcriber list relative to each service to identify those users which have established data paths with respect to each service.
Preferably, during system start up, the first provider ~ask is responsible for providing all other tasks in the system with the information included in the configuration list. Only the first provider task has access to configuration files which include the customer access information received from the remote data base.
A provider task such as the above mentioned second provider task for providing monitoring services should avoid making identical requests for data from the remote data base due to independent requests from different users. To that end, the provider task may receive specific data requests from user tasks and compile information correlating user tasks with specific data requests. For each data request, the provider determines whether a like request is pending for another tasX. Only if a like request is not pending would a specific data request be transferred to the remote data base. When the data is subsequently received from the remote data base, the provider determines from the compiled information all user tasks which have requested the received data, and the data is transferred to those user tasks. Preferably, the information is compiled 9232~

by generating a user tree and a symbol tree. ~ach user node of the user tree points to a list of symbols identifying the data requested by that user. Each node of the symbol tree points to the users which have requested the data represented by the symbol.
According to one broad aspect, the invention provides in a multitask electronic data processing system having means for receiving from a remote data base data of different types, a method of distributing the data from a provider task to plural user tasks subscribing to the data, the method performed by the electronic data processing system comprising: in response to calls from the user taskst establishing data paths between the provider task and the user tasks, each data path being specific to a type of data transferred to a single user; and by means of the provider task, dividing a data stream from the remote data base into plural data streams according to the data type and transferring the plural data streams to the user tasks through the established data paths.
According to another broad aspect, the invention provides a multitask electronic data processing system having means for receiving from a remote data base data of different types, a method of distributing the data from a provider task to plural user tasks subscribing to the data, the method performed by the electronic data processing system comprising: by means of a common code module linked to each user task, establishing data paths between the provider task and the user 3z~

tasks, each data path being specific to a type of data trans-ferred to a single user; and by means of the provider task, dividing a data stream from the remote data base into plural data streams according to the data type and transferring the plural data streams to the user tasks through the established data paths.
According to yet another broad aspect, the invention provides in a multitask electronic data processing system having means for receiving from a remote data base data, a method per-formed by the electronic data processing system of distributingthe data to plural user tasks comprising in a provider task:
receiving specific data requests from the user task and compil-ing information correlating user tasks with specific data requests; for each data request, determining whether a like request is pending for another task; only iE a like request is not pending, transferring to the remote data base the specific data request; receiving specific data from the remote data base;
determining from the compiled information all user tasks which have requested the received specific data; and transferring the specific data to user tasks which have requested the data.
According to still another broad aspect, the invention provides in a multitask electronic data processing system having means for receiving from a remote data base of different types in response to nonmonitoring requests for data and specific monitoring requests for data, the specific monitoring requests requiring the remote data base to monitor -8a-.~

`` ~L29~3~

data base sources with respect to specific identifiers, a method performed by the electronic data processing system for dis-tributing the data to plural user tasks subscribing to the data comprising: in a first provider task dividing a data stream of plural data types from the remote data base into plural data streams according to the data types; transferring from the first provider task at least one selected data stream in response to nonmonitoring requests directly to user tasks subscribing to the data streams and transferring at least one selected data stream in response to specific monitoring requests to at least a second provider task; and in a second provider task, dividing the data stream in response to specific monitoring requests into further data streams and transferring the further data streams to user tasks requesting the data streams.
Brief Descri tion of the Drawin s P _ ~
The foregoing and other objects, features and advantages of the invention will be apparent from the following more -8b-~i ~2~23;~

particular description of a preferred embodiment of the invention, as illustrated in the accompanying drawings.
Figure l is a bloc]c diagram of -the software architecture of a system embodying the present invention.
Figure 2 is an illus~ration of the configuration list, wait list and subscriber list5 stored in a provider task memory by means of an application program interface (RPI) common code module in the system of Flgure 1.
Figure 3 is an illustration of the configuration list and wait list stored in a user task memory by means of the API.
Eigure ~ illustrates a confiyuration file xetrieved by the primary provlder task through API.
Figures SA and 5B illustrate the message format of messages transferred by means of API.
Figures 6A and 6B illustrate the data structure of a symbol tree in the moni~or provider of Figure 1.

8~c Z3~

Figures 7A and 7B illustrate the data structure of a user tree in the monitor provider.
Figure 8 illustrates an add pending queue in the monitor provider.

Description o~ a Preferred Embodiment The present invention relates to a multitask, multiuser data processing system and may, for example, be implemented on a VS system from Wang Laboratories, Inc. In Figure 1, the block 20 represents the overall operating system of the multitask system. Overlayed on the operating system are a number of distinct programs which share the operating system to independently complete their respective tasks. For example, three user programs 22, 24 and 26 are illustrated. Each user program is associated with a respective computer terminal 28, 30 or 32. Within each user program, the multitask, multiuser character of the system is invisible to the user; however, for intertask communications, specific procedures mùst be followed to estahlish data paths through the operating system.
The present invention relates to the transfer of requests to and the return of data from a remote data base host computer 34. The host computer gathers real time trade and quotation information over many data lines which link the host to all exchanges and several supplemental services such as Dow Jones and Spectrum Institutional Holdings. This information includes real time stock exchange, over ~2~:323;~9~

the counter, option, commodity and fixed income data, as well as news and institutional holdings.
All communications between the remote data base 34 and the user programs 22, 24 and 26 are processed through a primary provider task 36. This task provides the data to the subcribiny users. The primary provider 36 includes conventional communications software for transferring and receiving data along telephone lines. The primary provider 36 must also make an initial determination as to what type of data is being received.
Specificallyj the primary provider determines the particular data service of which the data is a part.
The primary provider makes an initial distribution of the data. Most data of the broadcast class, all of which is kransmikted to all subscribers of the service, is transferred directly from the primary provider to the individual subcribing users. This class of services~includes the Dow Jones New Service (dj), the New York Stock Exchange Ticker (tk), ~ews Headlines (nh) and Reuters New Service (rt). An example of the trans-fer paths for data from these broadcast services to user programs 24 and 26 is illustrated in Figure 1.
These transfer paths are illustrated as~bçing in only one direction because, once the data path as been established, no further reguests from the user program to the remote data base are required. Other data services require more complex logic on the part of the provider. To prevent the primary provider from becoming over-burdened with distribution of ~29~3~4 data from those services, additional tasks 38 and 40 are provided.
In the present example, much of the data from the inquiry class of services is transferred by the primary provider to an inquiry provider 38. For example, with the Dow Jones New Retrieval Service (nr) the remote data base responds to speci~ic inquiries for news items relating to particular identifiers transmitted to the data base by a user.
The in~uiry provider 38 initially receives those requests from the user programs, determines whether a similar request is already pending, and if no similar request is pending, transfers the request through the primary provider to the remote data base 34. All data transferred back from that service i5 directed by the primary provider 36 to the i~guiry provider 38. The inquiry provider then examines its own records to identify the user program which macle the request and transFers the responsive data to just that user program. ~n the example illustrated in Figure 1, only user program 22 has subcribed to the Dow Jones News Retrieval Service, but the utility of the inquiry provider increases with increased subscriptions from other user programs and with an increased number of services of the inquiry class.
A final class of service is that in which the host computer monitors data based on a specific request for information identified by identifier symbols. The remote data base monitors all data as it is received from its sources and selects that ;2 32~

data for which a request is pending. The data is then transferred to the requesting user. Thus, the monitor class of services keeps an inquiry open. The monitor provider receives requests ~rom the user programs and, as did the inquiry provider, only forwards requests to the remote data base which are not already pending. The remote data base, for the most part, sees the multiuser system as a single user and only transmits a particular item of data once to the multiuser system When that data is received, it is directed to the monitor provider.
The monitor provider searches its records to determine which user program or programs requested the data and transfers the data to those user programs.
Market monitor data is encoded in a compressed format. The primary provider determines only that the data being received is of the market monitoring format and transfers all of that data (MM) in coded format to the monitor provider 40. The monitor provider then decodQs the data and directs it to the requesting user programs as one or more of three services. The basic market monitoring service (mm) responds to each price change in that particular stock. A select ticker service (sl) responds to each trade of the stock and identifies the volume and price of that trade. The block trade ticker (bt) identifies all trades which exceed ten thousand shares. Block trade is actually a broadcast class of service but it is encoded by the host computer with the market monitor service, so it is most 23~2~

efficiently decoded by the monitor provider.
Further, it is expected that block trading in the future will be a more selective service. As illus-trated in Fiqure 1, although all three services rely on the same data stream received from the remote data base, user programs may individually subscribe to select ones of the three.
One service which is of the inquiry class but which is handled entirely by the primary provider is that of stock price quotations (qt). Users expect that price quotations will be received very promptly, and the present system facilitates the prompt return of quotation data by minimizing the number of transfers of the quotation requests and return data through the operating system. The two transfers in each direction which result from use of the inquiry provider is avoided. The primary provider transmits the stock quote request with a sequence code which identifies the request in the primary provider. The sequence code is stored with the identity of the requesting user program in a first-in/first-out storage. The remote data base returns the data in the same order in which it is requested and returns the same sequence code with the data. The primary provider then returns the data to the requesting user task as it is identified from the first-in/first-out storage so long as the sequence numbers match. If a sequence number is skipped in the return data, the primary provider is able to either make the request again or notify the user prograrn that the request should be made again.

3Z~

A basic user program might allow the user to make specific requests within a service to which it subcribes and to suitably display the returned data.
However, it is contemplated that users will want to develop their own programs which are particularly suited to their particular needs. In ~act, users may wish to develop programs which have as only a small part thereof the need to obtain stock market information. A pension fund management program might be an example of such a program. In the past, retrieval of information from stock market services and other data bases has offered little flexibility to the programmer and has made linking of custom programs to the remote data base di~ficult or even impossible. The present system facilitates such communications by means of an application program interface (API) which facilitates the establishment of data transfer paths between tasks by making full use of the operating system capabilities while minimizing the programming effort required of the user program.
API is a code module of subroutines which may be linked to any one of the user and provider tasks.
Once the API code module has been linked to a user program, the program need only make simple calls to the subroutines to establish the data transfer paths. The user need not be aware of the capa-bilities and requirements of the underlying operating system because those capabilities and requirements have been taken into consideration in development of the code module. Further, the user 324~

program is insulaked from changes in the operating system. The system designer will maka appropriate changes in the API code module with changes in the operating system. Although the API code module offers its greatest advantages in interfacing lser programs to the operating system, it is also used to interface the provider background tasks. With this approach, the system designer, in making changes to the operating system, again need only modify the API
code module and need not modify the background provider tasks.
A further advantage of ~he particular ~PI code module to be described below is that it makes full use of the intertask message (ITM) capabilities of the Wang VS systems in creating mailboxes and transporting messayes to those mailboxes. In the Wang VS systems, a task is able to list ports, or mallboxes, in an operating system plist and then "put itself to sleep". In the present system, those plists are wait lists created by the API code module. The operating system monitors the plist and, when a message is recei~ed at a port on the plist, the operating system notifies the task associated with that plist. As a result, the task program need not continue to operate as the program walts for an event to occur. This feature of the operating system is particularly useful to the provider tasks in monitoring data requests from user programs and to user programs in monitoring the receipt of data from the host computer. Such events may occur at any time.

23~4 Intertask communications are handled efficiently by means of the API code module by the establishment of three types of lists. Figures 2 and 3 illustrate example list~ for the primary provider and user2. Each task which communicates through the API code module establishes a configur-ation list and a wait list throuyh API routines. In addition, each provider task may establish a subscriber list for each ~ervice that it provides.
Before establishing any data transfer paths, a provider or user task must first obtain a configura-tion list through the primary provider. The config-uration list includes a service code for each available service. The configuration list also indicates, for each ~ervice, whether the particular task is a provider of that service (indicated by a P
in the list). If the task is not a provider the list indicates whether the task has access to the service (indicated by Y for yes or an N ~or no). Each task is also provided with an ITM port, or mailbox address, to which messages requesting that service should be transferred.
Before a user can complete a request to a provider, the provider must have retrieved its configuration list. Based on its access and provider mailbox information provided in that list, the provider must have established itself to receive requests for the particular service by listing the mailbox at which it is to receive requests on its operating system wait list. In Fig. 2, the active status indicated for each service in the wait list ~;~9;~32~

indicates that the primary provider is ready to receive requests ~or each service on the wait list.
As already noted, the wait list is an operating system plist in the Wang VS system architecture.
Once the wait list has been established through the API code module, the provider program need not continue to monitor its mailboxes for the respective services. Rather, this chore is handled by the operating system by means of the wait list.
The provider may establish a subscriber list for each service and include in its configuration list a pointer to the starting address of each subscriber list (indicated by an * in Figure 2).
The user also establishes its wait list in thæ
operating system through API routines. The user may establish its own user port for each service to which it has access. That user port then serves as the mailbox for any data returned ~rom a provider.
The wait list includes each of its mailboxes on which it expects to receive data. Each mailbox on the wait list may be set at either an active or an ignore status; the operating system will only notify a task of transferred data to those mailb~xes which are active.
To subscribe to a servlce, a user looks to its configuration list in an API routine to obtain a provider mailbox address. Through the routine, it then constructs a sùbscription message as illustrated in Figure 5B and transmits that message to the designated provider mailbox. It may then wait to be notified by the operating system through ~923Z~ .

its user port that a message has been received. The subscription message is transferred by the operating system into the provider task mailbox and the provider task is notified that a message has been received. The provider then processes the subscription request and may place the user's return mailbox and other data for that service in the providerls subscriber list for that service. That other data includes the subscriber's workstation number, user I.D. and key.
By defining in the configuration list a unique provider mailbox for each service, the system allows each user program to independently establish data paths for the several services to which it sub-scribes. Although the host processor may include the particular user program as a customer and thus grant access to data for a particular service, within the local system any user may fail to subscribe or temporarily cancel any subscription to any service at any time without affecting subscriptions ~o other services. As a result, internal message traffic through the operating system can be minimized. The host processor is not informed of the user's status as a subscriber within the local system, 50 subscriptions and cancellations within the system do not affect the customer status of the user.
To provide for prompt access to the configur-ation information, a distinct configuration list is generated for each task in the system. Each task is able to efficiently obtain access to its list 3~

without requiring further transfer of data from a configuration file through the operating system.
However, in a multitask system in which a global memory is readily available to all tasks, the individual con~iguration lists may not be required.
Rather, the information may be o~tained from a centralized file. It is important, however, that each task have ready accesslto the providex mailbox addresses designated by the system and to its own access information with respect to each available service.
A more detailed description of the creation of the configuration, wait and subscriber lists and the API subroutines which allow for the efficient transfer of data follows.
As the initial recei~er of all information from the remote data base, the primary provider 36 has been selected as the focal program for initial--zation of programs with respect to transfers from the remote data base. As a part of the primary provider's initialization processing, it makes a call to a configuration ini~ialization ~PI routine called CNFINIT. CNFINIT reads a configuration file from disc storage. The primary provider also starts the communication line. When the host computer 34 detects that the line is active, it responds by sending out a services list for customers as discussed below. The primary provider consolidates the information received from the remote data base and from the disc storage to create the confiyuration file of Fig. 4.

~Z923~

-20~

The first item of the configuration file i5 a key for each task to be involved in the data transfer. In effect, the key is a logical name for a configuration record for each task. The ~eys P~IPRO, INQPRO and MONPRO are the names provided for the primary provider, inquiry provider and monitor provider, respectively. A further key ADMIN allows for the implementation of an administrative program if it is required for the particular needs of a system. Such a program may control designation of keys and control access to services ~y particular tasks and particular workstations.
The programs associated with the first four keys of the file are provider programs which typi-cally operate in background. An additional three Xeys USER1, US~2 and USER3 are indicated for each of the three user programs shown in Fig. 1. Of course, the system is not limited to three user programs. These programs are typically subscribers and may or may not operate in foreground.
The terminal I.D. field is the identifier by which the remote data base knows each user on a system. The data base grahts rights to particular services and bills for those services in a per terminal identification. Only user tasks need terminal I.D.s since they are the only true con-sumers of data. Suppliers may be thought of as merely an extension oe the remote data base and require no terminal I.D. The terminal I.D. also serves as an alternate key; the remote data base is unaware of the first key and sends its configuration records tagged by the terminal I.D. The terminal I.D.s are assigned by the remote data base when a customer requests new or expanded services.
The task number is forwarded to the primary provider with a key as each task is initialized.
The status field indicates whether a key,is in use and, if so, the work station number at which the associated task is being used. The status field may indicate that a task is being operated in back-ground. The workstations fields may be used by an administrator program to restrict the workstations on which a given key and its corresponding privi-leges may be used. The key may be restricted from or to a list of workstations which is simply illus-trated by an asterisk in Fig. 4.
The services field is expanded in the lower portion of Fig. 4. This list of fields defines, ~or each key, the associated program's role with respect to each defined service. The proyram may have any of three roles in connection with a ~iven service:
it may have full subscription privileges (Y); it may be the provider of the service (P); or it may have no rights at all for the service ~N). The subscriber rights given by the remote data base may be overruled by a local administrator program as indicated by y, for subscription allowed, and n, for subscription denied. The roles of providers are defined by the system designer.
During CFNINIT, primary provider ~6 also obtains a provider mailbox file from disc storage.
The provider mailbox for each service is later ~;~9Z32~

included in each configuration list o each task as illustrated in Figs. 2 and 3. Using the information from the provider mailbox file and the configuration file, the primary provider builds a prototype of the configuration list to be used by each task employing the API code module. The prototype configuration list contains one record for each defined service, and each record includes the ~ailbox, which is the ITM port name, of the provider of the service.
With the configuration file and the prototype configuration list on hand, the primary provider then generates its own personal configuration list by calling SCLINIT. By providing its key P~IP~O, it obtains its configuration listl based on the prototype list, with its access code P, Y or N taken from the configuration file for each service. Where a P i5 indicated for a service in the confiyuration li5t, the provider establishes as its mai~box the provider mailbox indica~ed in the configuration list. The provider also establishes a subscriber list ~or each such service and sets the cùrrent list size to zero. Further, each mailbox established by the provider pro~ram is placed by the API subroutine on an operating system plist for that task which will serve as a wait list. The wait status for each provider mailbo~ on the wait list is set to active.
~inally, the pri~ary provider program calls an API
routine SCL~AIT hy which it signals the operating system that it will wait for an indication that a messa~e has been received at any of its active mailhoxes on the wait list.

~L2~ 32~

With the initialization of the primary provider, other tasks may be initialized. To that end, each task calls the API routine SCLINIT, whereby it establishes an operating system wait list. As illustrated in Fig. 3, a wait list may initially include three pseudoservices emergency (em~, workstation (ws) and timer (tm). The emergency port allows the task to receive emergency messages at a high priority on the wait list. The workstation service allows the user program to utilize the wait list established by the API code module to wait ~or events which are to occur at the workstation terminal. With this pseudoservice, the user program need not delay receipt of data while waiting for an event such as a key stroke to occur at the terminal. Finally, the timer pseudoservice allows the program to set a timer by way of thQ wait list. It allows the user program to limit the time that it will wait for other events to occur.
During the SCLINIT routine, ~he task also obtains its configuration list which will provide it with the information required to subscribe to the services in the system. It,obtains that configur-ation list from the primary provider task and, to that end, the API subroutine has a default miniconfiguration list by which every tas~ is configured as a user of configuration data. A user subscribes to the configuration data through a mailbox "cfcf" to the primary provider.
When the configuration subscription message arrives at the mailbox "cfcf" of the primary 32~

provider, the operating system awakens the primary provider in the SCLWAIT routine. In response to the subscription message for configuration data a~ its mailbox "cfcf", the primary provider uses the user key provided in the subscription message to obtain the appropriate record in the configuration file and mark a copy of the prototype configuration list with the appropriate access code for each service for that key. The primary provider returns the customized configuration list to the subscribing mailbox, for example 20cf, and updates its master configuration file to indicate that the particular key is in use.
Through individual use of the SCLINIT routine, each task may have a full configuration list and a wait list which is empty but for the emergency, workstation and timer pseudoservices. The data paths illustrated in Fig. 1 have not yet been established. To establish the paths, each provider task calls a routine P~VOPEN, by which it establlshes a subscriber list which is initially empty. Both provider tasks, automatically during PRVOPEN, and subscriber tasks call a routine SCLOPEN. By the routine SCLOPEN, a provider task sets its mailbox for the service being opened to that indicated in the configuration list, and a subscriber task sets the mailbox to its task number plus the service code, as for example 20qt in Fig.
3. Any future messages to be received ~y the particular task for that service are received at the designated mailbox.

~ f ~ ~

-25~

Some tasks may serve as a subscriber to some services and as a provider of others. For example, the monitor provider serves as a subscriber to market monitoring service MM and as a provider of market monitoring service mm, select ticker service sl and block trade service bt. Similarly, the inquiry provider is a subscriber to news retrieval service NR and a provider of the distributed news retrieval service nr. Separate SCLOPEN routines must be called for each service.
In the SCLOPEN routineJ the mailbox is placed on the wait list for that task but is set to "ignore". A provider task then calls SCLLISTEN, whereby the particular mailbox on the wait list is set to active status. A subscriber task will typically first call a routine SCLSUBSCRIBE. By that routine a subscriber builds a subscription message as illustrated in Fig. 5B and transmits that subscription message to the provider mailbox obtained from its configuration list. The subscription message includes a return mailbox for the service at the subscriber and a flag indicating whether the message is for a subscription or cancellation. The message also includes a task number, a user I.D, and the user's key. The provider responds to the message by adding the subscriber ko the subscriber list for tha$ service.
The subscriber then typically entersiSCLLISTEN
whereby the associated mailbox on the wait list ~s set to active status.

:~L29~32~

Data returned to a subscriber mailbox by a provider may be read by entering the API routine SCLREAD in which the user obtains whatever information is then in the mailbox. Usually, however, a user enters the routine SCLWAIT whereby it signals the operating system to notify it when an event occurs at any of its active mailboxes.
Once a user has subscribed to a service, it may make specific re~uests of the remote data base through its provider by an SCLSEND routine in the API code module. Using this routine, the user program generates a message as illustrated in Fig.
5A which includes its mailbox for the service and a flag and message appropriate for the particular service and request. Under SCLSEND, the provider mailbox is obtained from the subscriber's configuration list and the message is sent~ The message is processed by the provider and, in the case of an inquiry provider or monitor provider, the provider might then generate its own message to be transmitted to the primary provider and on to a remote data base. The messages to the primary provider would be sent over paths previously established through the SCLOPEN and SCLSUBSCRIBE
routines.
Finally, when data is received by the provider from the host processor 34, the provider must forward the data to its subscribing users. It may call a PRVSEND routine whereby the provider refers to its subscription list for the particular service and sends the incoming data to those subscribers.

~Z9;~324 Alternatively, a provider such as the monitor provider may determine the mailboxes to which the data must be transmitted through its own internal lists.
In addition to the routines thus far described, there are inverse routines such as SCLTERM which is the inverse of SCLINIT, SCLCANCEL which is the inverse of SCLSUBSCRIBE, SCLIGNORE which i~ the inverse of SCLLIST~N and SCLCLOSE which is the inverse of SCLOPEN.
- An additional function SCLLIST allows a user program to add a number of user specified events to the wait list used by SCLWAIT. This pseudoservice (us) like the workstation pseudoservice, allows the user program to avoid further wait processin~ during which the receipt of incoming data might be delayed.
A more detailed description of the monitor provider task will now be presented with reference to Figures 6 through 8. The monitor provider must not only maintain a list of subscribers for each of the market monitor, select ticker and block trading services; it must also transfer specific requests that particular market symbols be monitored by the host and correlate the subscriber list with the requested symbols in order that data received from the host can be properly distributed. To that endJ
the monitor provider relies on a symbol tree illustrated in Fig. 6A and a user tree illustrated in Fig. 7A. Each tree is a binary threaded tree which additionally includes pointers to linked lists.

~L2~23~
-2~-In the case of the symbol tree, each node of the tree identifies a symbol which serves as an identifier to a particular security which is being monitored. Each node o~ the tree points to a linked list of users which have requested information with respect to that symbol. In the user tree, each node of the tree identifies a subscriber to any of the services from the monitor provider, and each node may point to a linked list of symbols which are being monitored for that user. For each symbol in the list linked to each user node, there is a corresponding symbol node in the symbol tree.
The user tree grows as additional user tasks subscribe to the monitor provider services. The symbol tree grows as the number of specific requests within each service increases. In each case, the initial user to subscribe or the initial symbol to be requested serves as the root of the tree.
Thereafter, additional nodes are added to the left or right of a preceding node depending on whether the new node has a lower or higher alphabetic value.
Thus, any symbol which alphabetically precedes the symbol MMM.N at the root of the symbol tree will be found to the left of the tree. With the use of a binary tree, the time re~uired to search the list for a particular item is reduced substantially.
This search time is particularly important where as many as 20 users and as many as 50 symbols per user may be listed in the trees.
Each node of the symbol tree includes the information listed in Fig. 6B. Each node includes 92~

the security symbol, the exchange on which that security is traded, and the most recent price for that security received from the host. It further includes pointers ~o the end users on the user list linked to that node. Pointers to and within each linked list are illustrated by broken arrows in Fig.
6A. The linked lists are doubled linkecl to facili-tate addiny and deleting nodes from the list.
Pointers to the left and righ~ children of each node are provided along with a pointer to the parent of the node. These pointers are illustrated by solid arrows in Fig. 6A. Threading of the tree by the pointers to the parents simplifies restructuring of the tree when symbols are added or removed. Each user node of the linked list includes the service by which the particular user has re~uested the symbol.
A service minding table included in each sym~ol node identifies all of the services included within its linked user list.
Each user node of the user list carries the information presented in Fig. 7B. It includes the return mailboxes identified in the subscriber's subscription message under the routine SCLSUBSCRIBE, the user's terminal I.D. and the user 15 key.
Further, each node includes pointers to the sym~ol list associated with that node and pointers to the children and parent of the node. Further, the user node includes its own service minding table. This minding table lists all of the services to which the particular user has subscribed. As illustrated by user 7 in Fig. 7A, the particular user need not have ~LZ9~3Z~

specific symbol requests pending to have a user node.
When a user subscribes to a service, through SCLSUBSCRIBE, the monitor provider scans the user tree to determine whether a user node has already been established for that task. If so, the new service to which the task is subscribing is added to the service minding table. If nott a new node is added as a leaf to the tree.
Thereafter, by means of an SCLSEND routine, the task may request that a particular symbol be monitored for that service. Prior to adding the symbol to the tree, a request must be transmitted to the host processor and the acknowledgement in the form of a price must be recie~ed from the host. A
request is only transmitted to the host processor if the same symbol within the same service has not previously been requested. To make that determination, the monitor provider first scans the symbol tree for the symbol which is to be requested.
If it locates that symbol, it notes the service minding table to determine whether the symbol has been requested for the desired service. If the symbol and service are located in the symbol tree, the user is adde~ to the linked user list to the symbol node, and the symbol is added to the linked symbol list of the user node. If, however, the symbol and service are not located on the symbol tree a request is made to the host.
When the request is made to the host, it is given a sequence number which is transmitted with the request. The host will acknowledge the request on a first-in/first-Qut basis and return the se-quence number. To determine whether an acknowledge-ment is received, a requested symbol is placed in an add pending queue illustrated in Fig. 8. Each node of the queue points to the next succeediny symbol to be requested. The sequence number is included with the requested symbol. In addition, each node of the queue points to a user node which may be included in a list.
When an acknowledgement is received, the symbol node is removed from the queue, and the pointer to the user node is transferred to that symbol's node in the symbol tree. If the symbol does not already have a node in the tree, a node is established.
Further, a node in a linked sym~ol list in the user tree is added for the particular user.
If an acknowledgement sequence number is received out of order, the system assumes that the skipped request was not successful and tran~mits a new request for the same symbol. The symbol is placed at the end of the add pending queue with a new sequence number. Also, a counter is clocked.
The counter allows a request to be retransmitted only three times to avoid an endless loop of requests for a symbol which is not being acknowledged.
When a user requests that a symbol be deleted from its service, the user tree is scanned to locate the user and that sym~ol is removed from the linked list. Then, the symbol tree is scanned for the ~L29;~3;2~

symbol and the user is removed from its linked list.
Further, as the linked list is scanned to locate the user, it is determined whether that user is the last to include that symb~l for a particular service. If so, that service is deleted from the symbol nade minding table. Thereafter, in scanning the symbol tree to ~etermine whether a particular service is pending for a symbol, it is not necessary to scan the linked user list because the minding table has been updated. If the deleted user i5 the last node on the linked user list, the full node is removed from the symbol tree. Also, a delete request is forwarded to the host processor.
If a delete re~uest is not properly received and processed by the host, the system may in the future receive update information which the host expects to be di~stributed. On scanning the symbol tree to locate the users of that data, no corres-ponding symbol node will be located. In that even~, a delete request is again transmitted to the host processor.
If the symbol is located in the symbol tree when information is recieved from the host, the linked user list is then scanned to identify the users which are to receive the particular data. The data is forwarded to those users at their appro-priate mailboxes determined by scanning the user tree.
The user tree is required in order to clear the symbol tree of symbols associated with that user when the user program calls the SCLCANCEL rou-tine, forwarding a cancellation message to the monitor ~LZ~23~

provider. On receipt of the message from that routine, the user tree i5 scanned for the u~er and the symbols are identified by scanning the linked symbol list. Then, the symbol tree is scanned for those symbols and the user is removed from the linked user list. ~gain, if the user is the last user to be linked to that symbol, the symbol is removed from the symbol tree and a delete request is forwarded to the host.
It can be noted that the block trade symbol bt is not included in either of the sample trees. This is because the block trade service is a broadcast service. It is only handled by the monitor provider because it is encoded with the market monitor data.
However, as a broadcast service, block trading is readily handled by the API routine PRVSUBSCRIBE ~y which the user is added to a subscriber list and PRVSEND by which data is distributed to the listed users.
While this invention has been particularly shown and described with references to a preerred embodiment thereof, 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 by the appended clai~s. For example, although the invention is directed primarily to a multitask system in which the tasks are performed in a single processing unit, the tasks may be distributed to other processing units while still incorporating certain features of the invention. Further, the invention has application to nonmarket data.

Claims (39)

1. In a multitask electronic data processing system having means for receiving from a remote data base of different types in response to nonmonitoring requests for data and specific monitoring requests for data, the specific monitoring requests requiring the remote data base to monitor data base sources with respect to specific identifiers, a method performed by the electronic data processing system for distributing the data to plural user tasks subscribing to the data comprising: in a first provider task dividing a data stream of plural data types from the remote data base into plural data streams according to the data types; transferring from the first provider task at least one selected data stream in response to nonmonitoring requests directly to user tasks subscribing to the data streams and transferring at least one selected data stream in response to specific monitoring requests to at least a second provider task;
and in a second provider task, dividing the data stream in response to specific monitoring requests into further data streams and transferring the further data streams to user tasks requesting the data streams.
2. A method as claimed in claim 1 further comprising the step of decoding the data stream in the second provider task.
3. A method as claimed in claim 1 further comprising, before transferring data to user tasks and by means of a common code module linked to each user task, the step of establishing data transfer paths between the provider tasks and the user tasks, each data transfer path being specific to a type of data transferred to a single user task.
4. A method as claimed in claim 3 further comprising, by means of a wait list established in an operating system, the step of monitoring provider task mailboxes with respect to each type of data to identify request from user tasks and of monitoring user task mailboxes with respect to each type of data to identify data being transferred to the user tasks.
5. A method as claimed in claim 4 further comprising, in establishing data paths, the step of generating a configuration list for each of the provider tasks and the user tasks from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
6. A method as claimed in claim 3 further comprising the step of generating in at least the first provider task, a subscribers list for identifying, relative to each type of data, the tasks which are to receive that type of data.
7. A method as claimed in claim 1 further comprising, by means of a wait list established in an operating system, the step of monitoring provider task mailboxes with respect to each type of data to identify requests from user tasks and of monitoring user task mailboxes with respect to each type of data to identify data being transferred to the user tasks.
8. A method as claimed in claim 1 further comprising establishing data transfer paths between the provider tasks and the user tasks, each data transfer path being specific to a type of data transferred to a single user task.
9. A method as claimed in claim 8 further comprising, in establishing data paths, the step of generating a configuration list for each of the provider tasks and the user tasks from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
10. A method as claimed in claim 1 wherein the second provider task receives specific data requests from the user tasks and compiles information correlating user tasks with specific data requests, the data being compiled by generating a user tree and a data-type tree, each user node of the user tree pointing to a list of data types requested by that user and each node of the data-type tree pointing to the users which have requested that type of data.
11. A method as claimed in claim 1 wherein the data comprises stock market information.
12. A method as claimed in claim 11 further comprising transferring stock quotation requests from the user tasks to the first provider task, providing each such request with a sequence number in the first provider task and transferring the request to the remote data base, the first provider task maintaining a record of users requesting the data with respect to sequence numbers and, by means of sequence numbers returned with the data, confirming receipt of data responses to the requests and forwarding the received data to the users which made the quotation requests.
13. In a multitask electronic data processing system having means for receiving from a remote data base data of different types, a method of distributing the data from a provider task to plural user tasks subscribing to the data, the method performed by the electronic data processing system comprising: by means of a common code module linked to each user task, establishing data paths between the provider task and the user tasks, each data path being specific to a type of data transferred to a single user; and by means of the provider task, dividing a data stream from the remote data base into plural data streams according to the data type and transferring the plural data streams to the user tasks through the established data paths.
14. A method as claimed in claim 13 further comprising the step of monitoring, by means of a wait list established through the common code module in an operating system, a user task mailbox with respect to each type of data to notify the user task of data being transferred to the user task.
15. A method as claimed in claim 14 further comprising, in establishing data paths, the step of generating a configuration list of each user task from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
16. A method as claimed in claim 15 wherein each configuration list indicates whether the task is a provider of data to other tasks, the method further comprising the step of limiting provider specific routines of the common code module to provider tasks.
17. A method as claimed in claim 15 further comprising the step of monitoring, by means of a wait list established through the common code module in an operating system, a mailbox to a provider task with respect to each type of data to notify the provider task of data being transferred to the provider task.
18. A method as claimed in claim 17 further comprising the step of generating a configuration list for each provider task from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred.
19. A method as claimed in claim 17 further comprising the step of generating in at least the provider task, a subscribers list for identifying, relative to each type of data, the tasks which are to receive that type of data.
20. A method as claimed in claim 14 further comprising the step of monitoring, by means of a wait list established through the common code module in an operating system, a mailbox to a provider task with respect to each type of data to notify the provider task of data being transferred to the provider task.
21. A method as claimed in claim 13 further comprising the step of generating in the provider task, a subscribers list for identifying, relative to each type of data, the tasks which are to receive that type of data.
22. A method as claimed in claim 13, further comprising, in establishing data paths, the step of generating a configuration list for each user task from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
23. A method as claimed in claim 13 wherein the data comprises stock market information.
24. In a multitask electronic data processing system having means for receiving from a remote data base data of different types, a method of distributing the data from a provider task to plural user tasks subscribing to the data, the method performed by the electronic data processing system comprising: in response to calls from the user tasks, establishing data paths between the provider task and the user tasks, each data path being specific to a type of data transferred to a single user; and by means of the provider task, dividing a data stream from the remote data base into plural data streams according to the data type and transferring the plural data streams to the user tasks through the established data paths.
25. A method as claimed in claim 24 further comprising in establishing data paths, the step of generating a configuration list for each of the provider tasks and the user tasks from a configuration file, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
26. A method as claimed in claim 25 further comprising the step of monitoring, by means of a wait list established in an operating system, mailboxes with respect to each type of data to the provider tasks to identify requests from user tasks and to user tasks to identify data being transferred to the user tasks.
27. A method as claimed in claim 24 further comprising, by means of a wait list established in an operating system, the step of monitoring provider task mailboxes with respect to each type of data to identify requests from user tasks and of monitoring user task mailboxes with respect to each type of data to identify data being transferred to the user tasks.
28. A method as claimed in claim 24 wherein the data comprises stock market information.
29. In a multitask electronic data processing system having means for receiving from a remote data base data, a method performed by the electronic data processing system of distributing the data to plural user tasks comprising in a provider task:
receiving specific data requests from the user task and compiling information correlating user tasks with specific data requests;
for each data request, determining whether a like request is pending for another task; only if a like request is not pending, transferring to the remote data base the specific data request;
receiving specific data from the remote data base; determining from the compiled information all user tasks which have requested the received specific data; and transferring the specific data to user tasks which have requested the data.
30. A method as claimed in claim 29 wherein the information is compiled by generating a user tree and a symbol tree, each user node of the user tree pointing to a list of symbols identifying data requested by that user and each node of the symbol tree pointing to the users which have requested the data represented by the symbol.
31. A method as claimed in claim 30 wherein each node of the user tree includes a listing of services to which that user has subscribed.
32. A method as claimed in claim 30 wherein each node of the symbol tree includes a listing of services through which users have made requests for the data identified by the symbol.
33. A method as claimed in claim 29 wherein the data comprises stock market information.
34. In a multitask electronic processing system having means for receiving data of different types, a method of distributing the data from provider tasks to plural user tasks subscribing to the data, the method performed by the electronic data processing system comprising: by means of a common code module linked to each user task, establishing data paths between the provider tasks and the user tasks, each data path being specific to a type of data being transferred to a single user, the data paths being established by each user task using a configuration list for each user task, each configuration list including the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data; by means of a wait list established in an operating system, monitoring provider task mailboxes with respect to each type of data to identify requests from user task and monitoring user task mailboxes with respect to each type of data to identify data being transferred to the user tasks;
receiving in a monitor provider task specific data requests from the user tasks and compiling information correlating user tasks with specific data requests, determining whether a like request is pending for another task, and only if a like request is not pending transferring through a primary provider task to the remote data base the specific data request; in the primary provider task, dividing a data stream of plural data types from the remote data base into plural data streams according to the data types;
transferring selected data streams in response to nonmonitoring requests directly to user tasks subscribing to the data streams and transferring at least one selected data stream in response to specific monitoring requests to the monitor provider task; and in the monitor provider task, dividing the data stream in response to specific monitoring requests into further data streams and transferring the further data streams to user tasks requesting the data streams.
35. A method as claimed in claim 34 wherein the data comprises stock market information.
36. A method as claimed in claim 13 wherein the data paths are established by routines of the common code module based on system configuration information available to the common code module routine, the routine being called by user task without regard for the provider task architecture.
37. A method as claimed in claim 36 wherein the configuration information is available through a configuration list which includes the name of a provider task mailbox to which requests for data of each type are to be transferred and an indication of whether the task has access to a particular type of data.
38. A method as claimed in claim 14 further comprising the step of including in the wait list events specified by the user other than data transfers from a provider task.
39. A method as claimed in claim 13 wherein data streams of a first type are transferred to specific user tasks depending on the content of the data streams, and data streams of a second type are transferred to all user tasks from a list of user tasks.
CA000544996A 1986-09-03 1987-08-20 Multitask subscription data retrieval system Expired - Lifetime CA1292324C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US06/903,495 US4815030A (en) 1986-09-03 1986-09-03 Multitask subscription data retrieval system
US903,495 1986-09-03

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CA000616098A Division CA1315891C (en) 1986-09-03 1991-06-25 Multitask subscription data retrieval system

Publications (1)

Publication Number Publication Date
CA1292324C true CA1292324C (en) 1991-11-19

Family

ID=25417593

Family Applications (2)

Application Number Title Priority Date Filing Date
CA000544996A Expired - Lifetime CA1292324C (en) 1986-09-03 1987-08-20 Multitask subscription data retrieval system
CA000616098A Expired - Fee Related CA1315891C (en) 1986-09-03 1991-06-25 Multitask subscription data retrieval system

Family Applications After (1)

Application Number Title Priority Date Filing Date
CA000616098A Expired - Fee Related CA1315891C (en) 1986-09-03 1991-06-25 Multitask subscription data retrieval system

Country Status (6)

Country Link
US (1) US4815030A (en)
EP (1) EP0258867B1 (en)
JP (2) JP3141943B2 (en)
AU (1) AU595354B2 (en)
CA (2) CA1292324C (en)
DE (1) DE3750941T2 (en)

Families Citing this family (113)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5230048A (en) * 1986-09-03 1993-07-20 Wang Laboratories, Inc. Data processing system with tree and list data structure
US5001666A (en) * 1987-10-19 1991-03-19 Motorola, Inc. Multiple interrupt tri-level microprocessor operating system
US5079695A (en) * 1988-04-25 1992-01-07 Hewlett-Packard Company Object management facility which includes a snapshot facility for providing data transfer between two objects
US5276866A (en) * 1988-07-19 1994-01-04 Michael Paolini System with two different communication mediums, transmitting retrieved video and compressed audio information to plural receivers responsively to users' requests
US5838917A (en) * 1988-07-19 1998-11-17 Eagleview Properties, Inc. Dual connection interactive video based communication system
US5361390A (en) * 1988-11-29 1994-11-01 International Business Machines Corporation Method for displaying and confirming the status of deferred system requests
JPH02195453A (en) * 1989-01-25 1990-08-02 Toshiba Corp File access control system
US5297283A (en) * 1989-06-29 1994-03-22 Digital Equipment Corporation Object transferring system and method in an object based computer operating system
US5557798A (en) * 1989-07-27 1996-09-17 Tibco, Inc. Apparatus and method for providing decoupling of data exchange details for providing high performance communication between software processes
US5187787B1 (en) * 1989-07-27 1996-05-07 Teknekron Software Systems Inc Apparatus and method for providing decoupling of data exchange details for providing high performance communication between software processes
US5257369A (en) * 1990-10-22 1993-10-26 Skeen Marion D Apparatus and method for providing decoupling of data exchange details for providing high performance communication between software processes
US6044205A (en) * 1996-02-29 2000-03-28 Intermind Corporation Communications system for transferring information between memories according to processes transferred with the information
US5434981A (en) * 1989-09-28 1995-07-18 Rockwell International Corporation Functionally programmable PCM data analyzer and transmitter for use in telecommunication equipment
JP3169597B2 (en) * 1990-05-16 2001-05-28 エヌイーシーソフト株式会社 Multitask execution time accounting method and its mechanism
US5144557A (en) * 1990-08-13 1992-09-01 International Business Machines Corporation Method and system for document distribution by reference to a first group and particular document to a second group of user in a data processing system
AU8517991A (en) * 1990-08-31 1992-03-30 Seer Technologies, Inc. Transaction processor
US5404488A (en) * 1990-09-26 1995-04-04 Lotus Development Corporation Realtime data feed engine for updating an application with the most currently received data from multiple data feeds
US5333318A (en) * 1990-09-27 1994-07-26 Motorola, Inc. Creating and searching a quad linked list in a trunked communication system
US5132900A (en) * 1990-12-26 1992-07-21 International Business Machines Corporation Method and apparatus for limiting manipulation of documents within a multi-document relationship in a data processing system
US5263167A (en) * 1991-11-22 1993-11-16 International Business Machines Corporation User interface for a relational database using a task object for defining search queries in response to a profile object which describes user proficiency
US8352400B2 (en) 1991-12-23 2013-01-08 Hoffberg Steven M Adaptive pattern recognition based controller apparatus and method and human-factored interface therefore
US5317695A (en) * 1992-04-03 1994-05-31 International Business Machines Corporation Method and system for permitting communication between a data processing system and input pointing devices of multiple types
JPH0668144A (en) * 1992-08-14 1994-03-11 Fujitsu Ltd Electronic news translation delivery device
JPH06110925A (en) * 1992-09-28 1994-04-22 Hitachi Ltd Computer connected with network and using method for the same
US5504874A (en) * 1993-09-29 1996-04-02 Silicon Graphics, Inc. System and method of implementing read resources to maintain cache coherency in a multiprocessor environment permitting split transactions
GB2345157B (en) 1998-12-23 2003-06-18 Ibm Publish and subscribe data processing apparatus, method and computer program product with declaration of a unique publisher broker
US5838918A (en) * 1993-12-13 1998-11-17 International Business Machines Corporation Distributing system configuration information from a manager machine to subscribed endpoint machines in a distrubuted computing environment
US5634081A (en) * 1994-03-01 1997-05-27 Adaptec, Inc. System for starting and completing a data transfer for a subsequently received autotransfer command after receiving a first SCSI data transfer command that is not autotransfer
US5619656A (en) 1994-05-05 1997-04-08 Openservice, Inc. System for uninterruptively displaying only relevant and non-redundant alert message of the highest severity for specific condition associated with group of computers being managed
US6769009B1 (en) 1994-05-31 2004-07-27 Richard R. Reisman Method and system for selecting a personalized set of information channels
US5694546A (en) 1994-05-31 1997-12-02 Reisman; Richard R. System for automatic unattended electronic information transport between a server and a client by a vendor provided transport software with a manifest list
US5502637A (en) * 1994-06-15 1996-03-26 Thomson Shared Services, Inc. Investment research delivery system
US5581687A (en) * 1994-11-10 1996-12-03 Baxter International Inc. Interactive control systems for medical processing devices
US5745748A (en) * 1994-12-09 1998-04-28 Sprint Communication Co. L.P. System and method for direct accessing of remote data
US5623696A (en) * 1995-05-30 1997-04-22 International Business Machines Corporation System for formatting a request into a packet which can be read by plurality of operating systems for providing a driver for a storage device
US5897635A (en) * 1995-06-07 1999-04-27 International Business Machines Corp. Single access to common user/application information
US6807558B1 (en) 1995-06-12 2004-10-19 Pointcast, Inc. Utilization of information “push” technology
US5740549A (en) * 1995-06-12 1998-04-14 Pointcast, Inc. Information and advertising distribution system and method
US20020178051A1 (en) 1995-07-25 2002-11-28 Thomas G. Scavone Interactive marketing network and process using electronic certificates
US6389593B1 (en) 1995-12-12 2002-05-14 Sony Corporation Method of and apparatus for controlling transmission of information on programs
US6625617B2 (en) 1996-01-02 2003-09-23 Timeline, Inc. Modularized data retrieval method and apparatus with multiple source capability
US5870605A (en) * 1996-01-18 1999-02-09 Sun Microsystems, Inc. Middleware for enterprise information distribution
US5873084A (en) * 1996-01-18 1999-02-16 Sun Microsystems, Inc. Database network connectivity product
US5823879A (en) * 1996-01-19 1998-10-20 Sheldon F. Goldberg Network gaming system
US6264560B1 (en) 1996-01-19 2001-07-24 Sheldon F. Goldberg Method and system for playing games on a network
US20090012864A1 (en) * 2007-07-02 2009-01-08 Goldberg Sheldon F Compensation model for network services
US9530150B2 (en) * 1996-01-19 2016-12-27 Adcension, Llc Compensation model for network services
US5862325A (en) * 1996-02-29 1999-01-19 Intermind Corporation Computer-based communication system and method using metadata defining a control structure
US5893911A (en) * 1996-04-17 1999-04-13 Neon Software, Inc. Method for defining and applying rules for message distribution for transaction processing in a distributed application
US5768528A (en) * 1996-05-24 1998-06-16 V-Cast, Inc. Client-server system for delivery of online information
US5916307A (en) * 1996-06-05 1999-06-29 New Era Of Networks, Inc. Method and structure for balanced queue communication between nodes in a distributed computing application
JP3702546B2 (en) * 1996-08-23 2005-10-05 ブラザー工業株式会社 Multifunctional peripheral device and storage medium
US6138162A (en) * 1997-02-11 2000-10-24 Pointcast, Inc. Method and apparatus for configuring a client to redirect requests to a caching proxy server based on a category ID with the request
US6173311B1 (en) 1997-02-13 2001-01-09 Pointcast, Inc. Apparatus, method and article of manufacture for servicing client requests on a network
GB9705469D0 (en) * 1997-03-17 1997-05-07 British Telecomm Re-usable database system
FR2762950B1 (en) * 1997-05-02 2000-08-04 Alsthom Cge Alcatel METHOD FOR TRANSMITTING A NOTIFICATION IN A NETWORK WITH DISTRIBUTED APPLICATIONS INCLUDING MULTIPLE NOTIFICATION SERVICES AND NETWORK FOR IMPLEMENTING IT
US6038601A (en) * 1997-07-21 2000-03-14 Tibco, Inc. Method and apparatus for storing and delivering documents on the internet
WO1999009490A1 (en) * 1997-08-18 1999-02-25 Tibco Software, Inc. Certified message delivery and queuing in multipoint publish/subscribe communications
US7080385B1 (en) 1997-08-18 2006-07-18 Tibco Software Inc. Certified message delivery and queuing in multipoint publish/subscribe communications
US6421570B1 (en) * 1997-08-22 2002-07-16 Honeywell Inc. Systems and methods for accessing data using a cyclic publish/subscribe scheme with report by exception
US6038597A (en) 1998-01-20 2000-03-14 Dell U.S.A., L.P. Method and apparatus for providing and accessing data at an internet site
US6144947A (en) * 1998-06-05 2000-11-07 Schwartz; Peter A. System for automatically determining net capital deductions for securities held, and process for implementing same
US7617124B1 (en) * 1998-12-04 2009-11-10 Digital River, Inc. Apparatus and method for secure downloading of files
US20030195974A1 (en) * 1998-12-04 2003-10-16 Ronning Joel A. Apparatus and method for scheduling of search for updates or downloads of a file
US7058597B1 (en) * 1998-12-04 2006-06-06 Digital River, Inc. Apparatus and method for adaptive fraud screening for electronic commerce transactions
US8181113B2 (en) * 1998-12-18 2012-05-15 Microsoft Corporation Mediating conflicts in computer users context data
US7225229B1 (en) 1998-12-18 2007-05-29 Tangis Corporation Automated pushing of computer user's context data to clients
US7231439B1 (en) 2000-04-02 2007-06-12 Tangis Corporation Dynamically swapping modules for determining a computer user's context
US8225214B2 (en) 1998-12-18 2012-07-17 Microsoft Corporation Supplying enhanced computer user's context data
US7046263B1 (en) * 1998-12-18 2006-05-16 Tangis Corporation Requesting computer user's context data
US7779015B2 (en) 1998-12-18 2010-08-17 Microsoft Corporation Logging and analyzing context attributes
US7107539B2 (en) 1998-12-18 2006-09-12 Tangis Corporation Thematic response to a computer user's context, such as by a wearable personal computer
US6968333B2 (en) 2000-04-02 2005-11-22 Tangis Corporation Soliciting information based on a computer user's context
US6791580B1 (en) * 1998-12-18 2004-09-14 Tangis Corporation Supplying notifications related to supply and consumption of user context data
US6801223B1 (en) 1998-12-18 2004-10-05 Tangis Corporation Managing interactions between computer users' context models
US6842877B2 (en) 1998-12-18 2005-01-11 Tangis Corporation Contextual responses based on automated learning techniques
US6920616B1 (en) * 1998-12-18 2005-07-19 Tangis Corporation Interface for exchanging context data
US6513046B1 (en) 1999-12-15 2003-01-28 Tangis Corporation Storing and recalling information to augment human memories
US9183306B2 (en) 1998-12-18 2015-11-10 Microsoft Technology Licensing, Llc Automated selection of appropriate information based on a computer user's context
US6549957B1 (en) * 1998-12-22 2003-04-15 International Business Machines Corporation Apparatus for preventing automatic generation of a chain reaction of messages if a prior extracted message is similar to current processed message
US6243757B1 (en) 1999-01-11 2001-06-05 Enuntio, Inc. Automated information filtering and distribution system
US7966078B2 (en) 1999-02-01 2011-06-21 Steven Hoffberg Network media appliance system and method
US7596606B2 (en) * 1999-03-11 2009-09-29 Codignotto John D Message publishing system for publishing messages from identified, authorized senders
US6404441B1 (en) 1999-07-16 2002-06-11 Jet Software, Inc. System for creating media presentations of computer software application programs
GB2354847A (en) 1999-09-28 2001-04-04 Ibm Publish/subscribe data processing with subscription points for customised message processing
GB2354848A (en) * 1999-09-28 2001-04-04 Ibm Publish/subscribe data processing with subscriber requested messageflow for customised message processing
US7107240B1 (en) 1999-10-06 2006-09-12 Goldman Sachs & Co. Order centric tracking system and protocol for communications with handheld trading units
US20030018569A1 (en) * 1999-10-06 2003-01-23 Joshua Eisenthal Enhanced interface for communicating with a handheld trading system
EP1272917A2 (en) * 2000-04-02 2003-01-08 Tangis Corporation Interface for exchanging context data
US7464153B1 (en) * 2000-04-02 2008-12-09 Microsoft Corporation Generating and supplying user context data
GB2367407B (en) * 2000-05-18 2004-12-29 Daiwa Shoken Group Honsha Kabu Transmission method for stock price information,system of the same,notification information database therefor,condition detection server and customer terminal
GB2364586B (en) * 2000-06-23 2004-06-16 Ebs Nominees Ltd Deal matching in an anonymous trading system
US7827085B1 (en) 2000-06-23 2010-11-02 Ebs Group Limited Conversational dealing in an anonymous trading system
US7333952B1 (en) 2000-06-23 2008-02-19 Ebs Group Limited Compound order handling in an anonymous trading system
US7184982B1 (en) 2000-06-23 2007-02-27 Ebs Group Limited Architecture for anonymous trading system
US7024386B1 (en) 2000-06-23 2006-04-04 Ebs Group Limited Credit handling in an anonymous trading system
US7366690B1 (en) * 2000-06-23 2008-04-29 Ebs Group Limited Architecture for anonymous trading system
US6983259B1 (en) 2000-06-23 2006-01-03 Ebs Group Limited Anonymous trading system
US20020054130A1 (en) * 2000-10-16 2002-05-09 Abbott Kenneth H. Dynamically displaying current status of tasks
GB2386724A (en) * 2000-10-16 2003-09-24 Tangis Corp Dynamically determining appropriate computer interfaces
US7363269B2 (en) * 2001-01-03 2008-04-22 Ebs Group Limited Conversational dealing system
US6961773B2 (en) 2001-01-19 2005-11-01 Esoft, Inc. System and method for managing application service providers
US7331050B2 (en) * 2001-06-06 2008-02-12 Intel Corporation System and method for communicating information between application programs
JP2003036219A (en) * 2001-07-25 2003-02-07 Sony Corp Contents distribution system, apparatus, method and program for managing contents reservation, and storage medium for contents reservation management program
US7383315B2 (en) * 2001-08-02 2008-06-03 National Instruments Corporation System and method for a delta page protocol for caching, replication, and client/server networking
US7127467B2 (en) * 2002-05-10 2006-10-24 Oracle International Corporation Managing expressions in a database system
US7523086B1 (en) 2003-01-28 2009-04-21 Unisys Corporation System for retrieving and processing stability data from within a secure environment
US20050216416A1 (en) * 2004-03-29 2005-09-29 Carl Abrams Business method for the determination of the best known value and best known value available for security and customer information as applied to reference data
US20080077651A1 (en) * 2006-09-05 2008-03-27 Ongrand Limited Information processing system with collaborating devices
US8775245B2 (en) 2010-02-11 2014-07-08 News America Marketing Properties, Llc Secure coupon distribution
US10366083B2 (en) 2015-07-29 2019-07-30 Oracle International Corporation Materializing internal computations in-memory to improve query performance
US10204135B2 (en) 2015-07-29 2019-02-12 Oracle International Corporation Materializing expressions within in-memory virtual column units to accelerate analytic queries
US11226955B2 (en) 2018-06-28 2022-01-18 Oracle International Corporation Techniques for enabling and integrating in-memory semi-structured data and text document searches with in-memory columnar query processing

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3597741A (en) * 1969-04-30 1971-08-03 Ultronic Systems Corp Information control in a processing system
GB1489573A (en) * 1974-10-18 1977-10-19 Automated Real Time Investment Communication system
US4447673A (en) * 1977-12-27 1984-05-08 Stromberg-Carlson Corporation Ring trip apparatus for a line circuit connected to DCO switch
US4349703A (en) * 1980-03-31 1982-09-14 International Telephone And Telegraph Corporation Programmable ring signal generator
JPS57211633A (en) * 1981-06-23 1982-12-25 Fujitsu Ltd Inter-program communication system
US4484270A (en) * 1982-07-07 1984-11-20 Sperry Corporation Centralized hardware control of multisystem access to shared and non-shared subsystems
DE3521248C2 (en) * 1984-06-29 1995-05-11 Merrill Lynch & Co Inc Financial information transmission, processing and display system

Also Published As

Publication number Publication date
JP2001188742A (en) 2001-07-10
EP0258867B1 (en) 1995-01-04
CA1315891C (en) 1993-04-06
AU7658487A (en) 1988-04-14
DE3750941T2 (en) 1995-08-10
EP0258867A3 (en) 1990-05-09
JP3141943B2 (en) 2001-03-07
DE3750941D1 (en) 1995-02-16
JP3247891B2 (en) 2002-01-21
US4815030A (en) 1989-03-21
AU595354B2 (en) 1990-03-29
EP0258867A2 (en) 1988-03-09
JPS6365536A (en) 1988-03-24

Similar Documents

Publication Publication Date Title
CA1292324C (en) Multitask subscription data retrieval system
US5230048A (en) Data processing system with tree and list data structure
US6510429B1 (en) Message broker apparatus, method and computer program product
US8386577B2 (en) Selection of communication protocol for message transfer based on quality of service requirements
US6445786B2 (en) Telemanagement system with single point of entry
US4845658A (en) Information method and apparatus using simplex and duplex communications
AU648113B2 (en) Apparatus and method for providing decoupling of data exchange details for providing high performance communication between software processes
US5408619A (en) Naming service database updating technique
US5768352A (en) Generalized statistics engine for telephone network
US20030135556A1 (en) Selection of communication strategies for message brokers or publish/subscribe communications
JP3274131B2 (en) Object-oriented point-to-point communication method and communication device for performing the method
US20040019612A1 (en) System and method for transmitting data content in a computer network
US20020016854A1 (en) Method of sending and receiving information and system using such method
GB2354913A (en) Information broker with dedicated processing of messages from different publishers
EP0213276A2 (en) Dynamic updating of data base directories
JPH0695999A (en) Method and system for inter-process communication
US5913027A (en) Data processing method for a computer system including computers connected via a communication path to each other and computer-readable recording media for use with the computers
US6035337A (en) Method and system for managing data flow within a collaboration system using proximity determination modules
CN1791102B (en) Network download tool
GB2227585A (en) Method and system for information distribution services
CA1321841C (en) Method for managing an electronic mail basket service
KR100324978B1 (en) message broker apparatus, method and computer program product
EP0213277A2 (en) Propagation system for user queries through a distributed data base
GB2354848A (en) Publish/subscribe data processing with subscriber requested messageflow for customised message processing
JPS6382042A (en) Delivery control system

Legal Events

Date Code Title Description
MKEX Expiry