CA2302321A1 - Adaptive processor system using a packet switched network - Google Patents

Adaptive processor system using a packet switched network Download PDF

Info

Publication number
CA2302321A1
CA2302321A1 CA002302321A CA2302321A CA2302321A1 CA 2302321 A1 CA2302321 A1 CA 2302321A1 CA 002302321 A CA002302321 A CA 002302321A CA 2302321 A CA2302321 A CA 2302321A CA 2302321 A1 CA2302321 A1 CA 2302321A1
Authority
CA
Canada
Prior art keywords
dspu
applications
connection
processing unit
database
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.)
Abandoned
Application number
CA002302321A
Other languages
French (fr)
Inventor
Jyri Suvanen
Jari Korhonen
Matti Lehtimaki
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.)
Nokia Oyj
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=8549575&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=CA2302321(A1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Individual filed Critical Individual
Publication of CA2302321A1 publication Critical patent/CA2302321A1/en
Abandoned 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/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5066Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs

Abstract

An arrangement for executing different applications associated with several connections by means of several processing units (DSPU). The arrangement comprises a controller (CTRL) and a database (DB), which comprises several different applications. The processing units (DSPU) and the controller (CTRL) are connected (22) with the database (DB). The controller (CTRL) allocates an available processing unit (DSPU) for each connection at the beginning of said connection, and identifies the applications required by the connection concerned, and loads the applications from the database (DB) to the allocated processing unit (DSPU).

Description

ADAPTIVE PROCESSOR SYSTEM
BACKGROUND OF INVENTION
The invention relates to processor systems used in the network elements of telecommunication systems, and particularly to allocation and configuration of resources to digital signal processors (dsp).
wth reference to Fig. 1, a digital signal processing unit DSPU
serving a connection 11 typically comprises, in addition to the actual processor (DSP), an interface I/O (Input/output) to the connection, and program . memory, which usually comprises read-only memory ROM and random 10 access memory RAM {and other supporting circuits, such as a clock and interrupt circuits, which are not, however, relevant to the invention). The connection 11 is divided into two parts: the part on which actual information is transmitted is indicated by 11, and the associated signalling is indicated by 112.
15 A problem in a system of this kind is that the configuration is inflexible. If there are several processor units DSPU and if different applications are executed by them, the program memory ROM of each processor unit must be sufficiently large to store all the applications. The applications include, for example, different speech coding methods, methods 20 of compressing and decompressing a video signal, echo cancellation, etc.
Since in the prior art the applications are installed either permanently or semi permanently (e.g. in rewritable ROM), the known processor units do not comprise a fast interface for updating the application. Consequently, another problem arises: when an application is being updated, the processor unit is out 25 of use.
In order that not all the applications would be needed in all the processor units, the processor units are typically arranged in pools. The data streams that need a particular application are conducted to the pool serving the application concerned. The problem is that the pools are permanent, so 30 the distribution of different data streams cannot be taken into account:
BRIEF DESCRIPTION OF INVENTION
The object of the invention is to provide a method and an arrangement implementing the method, solving the above problems. The object of the invention is achieved by a method and a system that are wo ~rns~ rcr~i9aroo~4~
characterized by what is stated in the independent claims. The preferred embodiments of the invention are claimed in the dependent claims.
The basic idea of the invention is to use a broadband packet swkched telecommunication network, preferably an ATM network, for 5 transferring applications from a common database of a multiprocessor system to processing units at least at the beginning of each connection and, if necessary, again during the connection. Preferably, the protocol of the ATM
network is used, and no conversion to the higher-level protocols of the OSI
model is needed.
10 A first embodiment of the claimed method and arrangement is based on arranging several processing units under a common control unit.
The applications are concentrated on a common database. In each connection, the applications (services) required by the connection are identified and subsequently loaded, under control of the control unit, to an 15 available processing unit. The processing unit and the database containing the applications are interconnected using fast connecting technology, preferably a broadband packet network, such as the ATM. Here the fast connecting technology means that an application can be loaded from the database to the processing unit during the connection, without that the user using the 20 connection notices any disturbing delay.
The technology of the invention leads to flexible use of the resources, since in each processing unit memory is needed only to store the largest application (or set of applications). Not all the applications need thus to be stored in the memory. Any processing unit whatsoever can serve any 25 connection whatsoever, since all the applications are available to all the processors. The suitable amount of memory in each processing unit is slightly greater (e.g. 30 to 100%) than the greatest amount of memory needed at a time or the amount of memory required by the largest single application or set of applications, but yet considerably smaller than the combined amount of 30 memory required by the different applications. A set of applications means applications associated with one and the same connection at a time. In the GSM, for example, a set of applications could comprise a full-rate codec and echo cancellation.
The technology of the invention is also reliable in respect of 35 mod~cations and updating. When an application is updated, the older version of the application can be retained although a newer version is loaded to the database. If the new application does not work properly, the older version can then be immediately put to use. When applications are updated, none of the processing units is out of use. Since the loading of all the applications of all the connections is controlled by the common controller, a further advantage is 5 achieved: the number of times that each application is used can be easily counted, if the operator wants to prepare statistics or if the supplier of the applications wants to charge for the number of times of use, rather than a lump sum.
A second embodiment of the method and arrangement of the 10 invention is a compromise between the prior art (in which the applications are located in permanent memories) and the first embodiment of the invention (in which the applications are loaded separatety for each connection). The compromise is achieved, for example, by keeping track of available processing units and of what applications have been loaded in which processing units. At 15 the beginning of each connection (and, where necessary, also during the connection), the applications required by the connection concerned are identified, and an available processing unit to which as targe a part as possible of the applications required has been loaded is selected for the connection.
The missing applications are then loaded to the processing unit from the 20 database.
The definition 'as large a part as possible' can be interpreted in at least two ways: either as few applications as possible need to be loaded to the selected processing unit, or an application (set of applications) that is as small as possible needs to be loaded. If one processing unit can serve several 25 connections, then the 'available processing unit' is here a unit that has at least some processing capacity available.
Apart from the above advantages, the second embodiment also has the advantage that if the necessary applications have already been loaded to one processing unit, no applications need be loaded to the processing un~s.
30 This is particularly useful to the network operator in distributed systems, in which the database and the processing units are a long distance apart, and in which the operator also has to pay for the network capacity reserved for transferring the applications.
Although the maximum advantage is achieved by the invention 35 when there are several processing units, the technology of the invention can also be applied when there is only one processing unit, if the number of the WO 99/15983 p~/~9g/pp~4~
processing units can be expected to rise (e.g. as the traffic load increases).
If there is only one processing unit, the selecting of an available processing unit simply means that it is checked whether all the capacity of the processing unit is already in use:
BRIEF DESCRIPTION OF DRAWINGS
In the following the invention will be described in greater detail by means of preferred embodiments and with reference to the attached drawings, in which Fig. 1 is a block diagram of a previously known digital processing unit, and Fig. 2 is a block diagram of an arrangement according to the present invention.
DETAILED DESCRIPTION OF INVENTION
The arrangement according to the second embodiment of the invention illustrated in Fig. 2 comprises a database DB to which the applications are loaded, and a control unit or controller CTRL, as well as processing units DSPU. The arrangement also comprises a broadband transmission path that combines the different blocks, the path being preferably an ATM switch system 22. The database DB comprises, i.e. in the database 20 are stored, all the applications to be executed in the arrangement (different coding algorithms, etc.). It is possible to keep track of the applications contained in the database DB, for example, by means of a table 28, which shows, for each application, at least an identifier Appl_1 to Appl n and the size of the application, i.e. the amount of memory required by the application.
25 The table may also indicate the Location of each application in the database (unless the database DB accepts the identifier Appl_1 to Appl n of the application as such as an indication of the application concerned). The table can also be used to maintain the version number of the applications.
The processing units DSPU substantially correspond to the 30 previously known processing unit illustrated in Fig. 1, but read-only-memory ROM is here needed only to transfer applications from the database DB via the switch system 22. The ROM thus mainly corresponds to an initial, or bootstrap, loader of a common computer. The loading of an application from the database to the processing units takes place at an optimal rate if the 35 protocol of the network itself (e.g. ATM network) can be used and no time nor wo ~ns~ pcT~9soo~ai resources need to be wasted on converting the protocols to the higher-level protocols (e.g. TCPIIP) of the OSI model. However, it is advisable to supplement the protocol of the ATM network with error detection and retransmission in case a packet is lost or distorted.
5 The resource management is controlled by the controller CTRL.
Reference number 21 indicates an interface between the controller CTRL and the switch system 22, and the interface comprises a control connection 21, for controlling the switch system 22, Operation And Management OAM 21 z, and a signalling connection 213. At the beginning of each connection, the controller .10 CTRL identifies the applications needed by each connection C1 to Cn, for example on the basis of the signalling connection associated with the connection. The identification of the applications needed by a connection is a standard procedure for a person skilled in 'the art, and in the prior art arrangements an available processing unit whose software comprises the 15 application required would be allocated for the connection on the basis of the identification. According to the first embodiment of the invention, all the processing un~s are equal, and the controller CTRL allocates any available processing unit DSPU whatsoever for the connection concerned. According to the second embodiment of the invention, the controller checks whether the 20 necessary applications have been loaded to an available processing unit.
The controller then initiates the loading of any necessary applications ftom the database DB to the processing unit serving the connection concerned.
Reference number 23 indicates an intertace between the database DB and the switch system, and the interface comprises a broadband transmission path 23, 25 for loading applications via the switch system 22 to the processing units DSPU, and a signalling connection 232, through which the controller CTRL
notifies the database what applications are to be loaded to which processing units.
The controller CTRL can maintain information on the allocation of 30 the processing units, for example by means of a table 29, which shows, for each processing unit, the amount of memory (unless the amount is the same for all the processing units), the connections that the unit serves and the applications it contains. Let us now presume that in Fig. 2 each processing unit can serve two connections, and a need arises to serve a new connection 35 which needs applications Appl 2 and Appl 3. Processing unit DSPU3 has the applications stored in its memory, but all its processing capacity has already been allocated. Processing unit DSPU1 lacks application App! 3, and processing unit DSPU2 lacks application Appl 2. If Appl 3 is presumed to require less memory than Appl 2, the least amount of loading is needed if DSPU1 is allocated for the new connection and Appl 3 is loaded thereto. (The 5 table 28 of Fig. 2 is, in fact, a simplified presentation: the size of an application in the database DB is not always the same as the total amount of memory required by the application. In reality, the applications also require data memory, i.e. working space, the amount of which must be taken into account in the memory management of the processing units but which need not be 10 loaded to the processing units:) If there is not enough space in the RAM of the processing unit for the new applications to be loaded, the controller can command the processing unit to delete from the memory an application that is not needed at that moment. Alternatively, it is possible to check whether there is enough space for the application to be loaded in the memory of some other 15 processing unit.
The controller CTRL can load the application from the database DB
one block at a time and subsequently forward it to the processing unit DSPU.
Alternatively, if the database DB and the processing units DSPU are sufficiently independent, the controller CTRL can start the transfer of the 20 application directly from the database to the processing unit.
The switch system 22 and the controller CTRL can be otherwise conventional parts of the ATM switch system, but the controller CTRL is supplemented with the operations described above. The controller CTRL is preferably implemented using a digital processor. The programs of the 25 controller can be located either in the controller itself or in the database DB, from which the controller retrieves them when it is activated andlor when it detects (on the basis of the signalling connection 213) that the software has been updated.
The controller CTRL and the database DB are shown as separate 30 units. The division is rather a logical than a physical one, and it helps to clarify the functions performed in the arrangement of the invention. Fig. 2 could also be drawn to show the two elements combined, whereby it would be possible to talk about an 'intelligent database.' The blocks of Fig. 2 can be located in one and the same network 35 element. An example for such an element could be a base station controller or a transcoder unit of a mobile system, or a video-on-demand server. Since the WO 99/15983 PCT/P'I98/00741 arrangement according to the invention enhances the utilization of the resources, the maximum advantage is achieved if as large a number of applications as possible, for example different coding techniques and echo cancellation, are concentrated on one and the same arrangement.
5 An alternative to the above compact arrangement would be geographical distribution of the blocks of Fig. 2, for example, in such a way that the common controller and database would serve a large number of processing units located a long distance apart. A preferred arrangement is that the equipment supplier maintains the database DB, but the operator stores the 10 corresponding applications in its cache memory. In the arrangement of Fig.

the cache could be located along connection 23 (or 21 ). This is a relatively simple way of providing redundancy: one secured database serves all the processing units of a network or a part of the network. This also allows the network elements to 'borrow' processing units from one another during peak 15 traffic.
The above first embodiment of the invention can thus be implemented by providing a database DB that comprises several applications and by arranging a fast interface 22, 23, 24 between the processing units and the database DB. At the beginning of each connection, an available 20 processing unit is allocated for the connection, the applications required by the connection concerned are identified, and the applications are loaded to the allocated processing unit from the database DB.
Correspondingly, the second embodiment of the invention (in which the applications are loaded where necessary) can be implemented by a 25 method comprising the steps of:
( 1 ) forming a database DB that comprises several applications Appl_1 to Appl n and arranging a fast interface 22, 23, 24 from the database to processing units DSPU_1 to DSPU n so as to load applications to them;
(2) keeping track of available processing units and of what 30 applications have been loaded to the processing units; and at least at the beginning of each connection, (3) identifying the applications required by the connection concerned, (4) allocating an available processing unit for the connection 35 concerned, preferably one to which as large a part as possible of the applications required by the connection concerned is loaded, and (5) if the processing unit concerned lacks any of the applications required by the connection concerned, loading the application to it from the database D8.
The identification of the necessary applications and the loading of 5 the applications to the processing units DSPU can also take place later during the connection. For example, the terminal equipment units of the mobile system can change the speech coding method or negotiate about the use of an echo canceller during the connection (especially when they change cells).
The controller CTRL detects this (e.g. on the basis of the signalling 10 connection) and repeats steps (3) to (5). The repetition of the steps can be interpreted in at least two ways. According to the first interpretation, a processing unit allocated for the connection is not changed during the connection, but any additional applications needed are loaded to the processing unit that has been allocated at the beginning of the connection.
15 According to the second interpretation, the allocation of a processing unit taking place in step (4) can also be repeated during the connection. If, for example, the terminals decide to transfer from a full-rate codec to a half rate codec and there is available at least one processing unit to which a half rate codec has been loaded, then the controller CTRL can assign this processing 20 unit to serve the connection concerned.
With technical advances, it will be obvious to a person skilled in the art that the basic idea of the invention can be implemented in various ways.
The invention and its embodiments are thus not limited to the above examples but can vary within the scope of the claims. .

Claims (14)

9
1. A method of executing at least one application (Appl_1 to Appl_n) associated with a telecommunications connection (C1 to Cn) by at least one processing unit (DSPU_1 to DSPU_n), the method comprising the steps of (i) forming a database DB that comprises several applications and operationally connecting it to the processing units via a fast packet-switched network (22 to 24) so as to load applications to them; and at least at the beginning of each telecommunications connection (ii) allocating an available processing unit (DSPU_1 to DSPU_n) for the telecommunications connection in question, (iii) identifying the applications required by the telecommunications connection in question, characterized by (iv) loading the applications required by the telecommunications connection in question to the allocated processing unit from said database (DB) via said fast packet-switched network using the protocol of the network without conversion to higher-level protocols.
2. A method of executing at least one application (Appl_1 to Appl_n) associated with a connection (C1 to Cn) by at least one processing unit (DSPU_1 to DSPU_n), the method comprising the steps of (1) forming a database DB that comprises several applications and operationally connecting it to the processing units via a fast packet-switched network (22 to 24) so as to load applications to them;
(2) keeping track of available processing units and of what applications have been loaded to the processing units; and at least at the beginning of each connection, (3) identifying the applications required by the connection concerned, characterized by (4) allocating an available processing unit for the connection concerned, preferably one to which as large a part as possible of the applications required by the connection concerned has been loaded, and (5) if the processing unit allocated lacks any of the applications required by the connection concerned, loading the missing applications thereto from said database via said fast packet-switched network using the protocol of the network without conversion to higher-level protocols.
3. A method according to claim 1 or 2, characterized by loading the applications to the processing unit (DSPU_1 to DSPU_n) via the same interface (24) through which the information associated with said connection (C1-Cn) is transferred to the processing unit.
4. A method according to any one of claims 1 to 3, characterized by loading the applications to the processing unit via an ATM
network.
5. A method according to claim 1 or any of claims 2 to 4, characterized by re-conducting steps (ii) to (iv) or, respectively, (2) to (5) during the connection if necessary.
6. A method according to any one of claims 1 to 5, characterized by controlling steps (ii) to (iv) or, respectively, (2) to (5) by a separate controller (CTRL) common to all the processing units.
7. An arrangement for executing at least one application (Appl_1 to Appl_n) associated with a telecommunications connection (C1-Cn) by at least one processing unit (DSPU_1 to DSPU_n), in which the arrangement further comprises a controller (CTRIL) and a database (DB) that contains several different applications;
a fast packet-switched network (22 to 24) is arranged from the processing units (DSPU_1 to DSPU_n) to said database (DB); and the controller (CTRL) is arranged to allocate, at least at the beginning of each telecommunications connection, an available processing unit (DSPU_1 to DSPU_n) for the telecommunications connection concerned, characterized in that the controller (CTRL) is arranged to identify the applications required by the telecommunications connection concerned, and to load them to the allocated processing unit (DSPU_1 to DSPU_n) from said database (DB) via said fast packet-switched network using the protocol of the network without conversion to higher-level protocols.
8. An arrangement for executing at least one application (Appl_1 to Appl_n) associated with a connection (C1-Cn) by at least one processing unit (DSPU_1 to DSPU_n), in which the arrangement further comprises a controller (CTRIL) and a database (DB) that contains several different applications;

3 100:10:5 2:1 195 a fast packet-switched network (22 to 24) is arranged from the processing units (DSPU_1 to DSPU_n) to said database (DB); and the controller (CTRL) is arranged to keep track of available processing units and of what applications have been stored in the processing units;
characterized in that, at least at the beginning of each connection, the controller (CTRL) is arranged to identify the applications required by the connection concerned;
allocate an available processing unit for the connection concerned, preferably one to which as large a part as possible of the applications required by the connection concerned has been loaded; and if the processing unit allocated lacks any of the applications required by the connection concerned, load the missing applications thereto from said database via said fast packet-switched network using the protocol of the network without conversion to higher-level protocols.
9. An arrangement according to claim 7 or 8, characterized in that the controller (CTRL) is common to all the processing units (DSPU_1 to DSPU_n).
10. An arrangement according to any one of claims 7 to 9, characterized in that each processing unit (DSPU_1 to DSPU_n) comprises memory (M1-Mn), the amount of memory being somewhat, preferably 30 to 100%, greater than the greatest amount of memory required by the applications (Appl_1 to Appl_n) associated with a single connection (C1 to Cn), yet notably smaller than the combined amount of memory required by the applications of the arrangement.
11. An arrangement according to any one of claims 7 to 10, characterized in that all said parts are located in one and the same network element.
12. An arrangement according to any one of claims 7 to 10, characterized in that not all said parts are located in one and the same network element.
13. An arrangement according to any one of claims 7 to 12, characterized in that said fast network (22 to 24) from the processing units (DSPU_1 to DSPU_n) to the database (DB) is formed via an ATM
network.
14. Use of a broadband packet-switched telecommunication network, preferably an ATM network, for transferring applications (Appl_1 to Appl n) from a database (DB) to a processing unit (DSPU_1 to DSPU_n) during a telecommunications connection, the transfer being performed using the protocol of said packet-switched telecommunication network, substantially without any conversion to higher-level protocols.
CA002302321A 1997-09-23 1998-09-22 Adaptive processor system using a packet switched network Abandoned CA2302321A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FI973761 1997-09-23
FI973761A FI107842B (en) 1997-09-23 1997-09-23 Adaptive processor system
PCT/FI1998/000741 WO1999015983A2 (en) 1997-09-23 1998-09-22 Adaptive processor system using a packet switched network

Publications (1)

Publication Number Publication Date
CA2302321A1 true CA2302321A1 (en) 1999-04-01

Family

ID=8549575

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002302321A Abandoned CA2302321A1 (en) 1997-09-23 1998-09-22 Adaptive processor system using a packet switched network

Country Status (11)

Country Link
US (1) US6681253B1 (en)
EP (2) EP1619580B1 (en)
JP (1) JP3658704B2 (en)
CN (1) CN1329851C (en)
AT (2) ATE315253T1 (en)
AU (1) AU9349598A (en)
CA (1) CA2302321A1 (en)
DE (2) DE69840921D1 (en)
ES (1) ES2255182T3 (en)
FI (1) FI107842B (en)
WO (1) WO1999015983A2 (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6598146B1 (en) * 1999-06-15 2003-07-22 Koninklijke Philips Electronics N.V. Data-processing arrangement comprising a plurality of processing and memory circuits
CA2349140A1 (en) * 2000-05-31 2001-11-30 Nortel Networks Limited Connection negotiation for voice over internet protocol using multiple steps
US8015303B2 (en) * 2002-08-02 2011-09-06 Astute Networks Inc. High data rate stateful protocol processing
US8151278B1 (en) 2002-10-17 2012-04-03 Astute Networks, Inc. System and method for timer management in a stateful protocol processing system
US7596621B1 (en) * 2002-10-17 2009-09-29 Astute Networks, Inc. System and method for managing shared state using multiple programmed processors
US7814218B1 (en) 2002-10-17 2010-10-12 Astute Networks, Inc. Multi-protocol and multi-format stateful processing
US20050262311A1 (en) * 2004-05-20 2005-11-24 Lippincott Louis A Hierarchical processor architecture for video processing
KR100860160B1 (en) * 2004-05-20 2008-09-24 인텔 코오퍼레이션 Hierarchical processor architecture for video processing
US20070094306A1 (en) * 2005-10-26 2007-04-26 Kyriazakos Nikolaos G Method and model for enterprise system development and execution

Family Cites Families (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5005122A (en) * 1987-09-08 1991-04-02 Digital Equipment Corporation Arrangement with cooperating management server node and network service node
JPH04291538A (en) * 1991-03-19 1992-10-15 Fujitsu Ltd Down-load system using standby line
US5504670A (en) * 1993-03-31 1996-04-02 Intel Corporation Method and apparatus for allocating resources in a multiprocessor system
US5600643A (en) 1993-09-23 1997-02-04 Bell Communications Research, Inc. Broadband intelligent telecommunications network and method providing enhanced capabilities for customer premises equipment
US5426694A (en) 1993-10-08 1995-06-20 Excel, Inc. Telecommunication switch having programmable network protocols and communications services
US5421009A (en) * 1993-12-22 1995-05-30 Hewlett-Packard Company Method of remotely installing software directly from a central computer
US5577105A (en) * 1994-03-11 1996-11-19 U.S. Robotics, Inc. Telephone call routing and switching techniques for data communications
US5859981A (en) 1995-07-12 1999-01-12 Super P.C., L.L.C. Method for deadlock-free message passing in MIMD systems using routers and buffers
US6199093B1 (en) * 1995-07-21 2001-03-06 Nec Corporation Processor allocating method/apparatus in multiprocessor system, and medium for storing processor allocating program
US6021263A (en) * 1996-02-16 2000-02-01 Lucent Technologies, Inc. Management of ATM virtual circuits with resources reservation protocol
US6298120B1 (en) * 1996-06-28 2001-10-02 At&T Corp. Intelligent processing for establishing communication over the internet
US6195678B1 (en) * 1996-09-03 2001-02-27 Fujitsu Limited Remote resource management system for automatically downloading required files from application server depending on contents of selected files on requesting computer
JP3372797B2 (en) * 1996-12-06 2003-02-04 日本電気株式会社 Bandwidth reservation control method
GB2320642A (en) * 1996-12-21 1998-06-24 Ibm Distributed voice processing system
US6061442A (en) * 1997-03-07 2000-05-09 Lucent Technologies Inc. Method and apparatus for improved call control scheduling in a distributed system with dissimilar call processors
US5958010A (en) * 1997-03-20 1999-09-28 Firstsense Software, Inc. Systems and methods for monitoring distributed applications including an interface running in an operating system kernel
US5970488A (en) * 1997-05-05 1999-10-19 Northrop Grumman Corporation Real-time distributed database system and method
US6021442A (en) * 1997-07-17 2000-02-01 International Business Machines Corporation Method and apparatus for partitioning an interconnection medium in a partitioned multiprocessor computer system
US6104721A (en) * 1997-12-02 2000-08-15 Symmetry Communcations System DSP based dynamic resource allocation multiprocessor communications board
US6208642B1 (en) * 1997-12-19 2001-03-27 Ericsson Inc Architecture independent application invocation over a telephony network
US5999990A (en) * 1998-05-18 1999-12-07 Motorola, Inc. Communicator having reconfigurable resources
US6421338B1 (en) * 1998-06-05 2002-07-16 Lucent Technologies Inc. Network resource server
US6240086B1 (en) * 1999-10-15 2001-05-29 Texas Instruments Incorporated Dynamic DSP allocation for universal access to a packet network

Also Published As

Publication number Publication date
EP1023671B1 (en) 2006-01-04
ES2255182T3 (en) 2006-06-16
ATE434215T1 (en) 2009-07-15
AU9349598A (en) 1999-04-12
FI107842B (en) 2001-10-15
WO1999015983A2 (en) 1999-04-01
CN1271438A (en) 2000-10-25
DE69833124T2 (en) 2006-07-20
WO1999015983A3 (en) 1999-05-20
EP1619580B1 (en) 2009-06-17
JP2001517835A (en) 2001-10-09
ATE315253T1 (en) 2006-02-15
JP3658704B2 (en) 2005-06-08
US6681253B1 (en) 2004-01-20
DE69840921D1 (en) 2009-07-30
EP1619580A2 (en) 2006-01-25
FI973761A (en) 1999-03-24
CN1329851C (en) 2007-08-01
EP1023671A2 (en) 2000-08-02
DE69833124D1 (en) 2006-03-30
FI973761A0 (en) 1997-09-23
EP1619580A3 (en) 2006-05-17

Similar Documents

Publication Publication Date Title
US5805827A (en) Distributed signal processing for data channels maintaining channel bandwidth
US5838766A (en) System and method for providing shared resources to test platforms
US6681253B1 (en) Adaptive processor system
JPH0341854A (en) Audio message transmitter for automatic exchange
US5381471A (en) Centralized service circuit deployment
US5594915A (en) Microcell computer system and method using cell access switch and functionally partitioned moving memory architecture
CN100559901C (en) In communication network, set up method and node that priority connects
US7809832B2 (en) System and method of processing data flow in multichannel, multi-service environment by dynamically allocating a socket
US6178168B1 (en) Method of controlling connections in a telecommunication system
US6389001B1 (en) Method for downloading data to add functions to vocoder
US6883039B1 (en) Method for optimized processing of connections conducted outside a switching center
US6163833A (en) Memory managing method for use in a data communications system
KR100233458B1 (en) Duplexing method for remote multiple subscriber
KR100385220B1 (en) Apparatus and Method of Managing Common Resources in the Communication System
US7031752B1 (en) Media resource card with programmable caching for converged services platform
KR100436658B1 (en) Method for managing a buffer by data link layer controlling module installed in a mobile telecommunications terminal
US7319741B1 (en) Media resource card with dynamically allocated resource points
KR100259858B1 (en) The efficient method of isdn data channel and buffer for this
JP2972210B2 (en) Time switch control method
KR20030084008A (en) Method for block loading memory re-using in a mobile communication system
US20030163806A1 (en) Software downloading system for data transmission device
KR20030008768A (en) Resource Management Of RNC Resource Management Block (RRMM) In Asynchronous IMT-2000 System
KR20020070619A (en) Method for assigning a reserved exclusive connection of an asynchronous transfer mode exchange
KR19980045938A (en) Temporary Storage Location Allocation Method of Packet Layer Processor
JPH0744581B2 (en) Bufferable management method

Legal Events

Date Code Title Description
FZDE Discontinued