Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Use of end to end compression devices in telecommunication networks
Patent Number: 6,795,497 Issued on 09/21/2004 to Shalem

Title: Spread spectrum communication apparatus
Patent Number: 6,795,488 Issued on 09/21/2004 to Iwakiri

Title: Method of compensating kickback voltage for a liquid crystal display device
Patent Number: 7,061,461 Issued on 06/13/2006 to Hong

Title: Combined cycle plant
Patent Number: 6,983,585 Issued on 01/10/2006 to Hattori,   et al.

Title: Tail bone cushion
Patent Number: 6,820,938 Issued on 11/23/2004 to Barrett

Title: Fishing accessory apparatus
Patent Number: 6,983,560 Issued on 01/10/2006 to Williams

Title: Ultra-wideband antenna
Patent Number: 7,061,442 Issued on 06/13/2006 to Tang,   et al.

Title: Device and method for interfacing video devices over a fiber optic link
Patent Number: 7,061,405 Issued on 06/13/2006 to Boyd,   et al.

Title: Door and frame with peripheral venting for electronic component cabinet
Patent Number: 6,983,566 Issued on 01/10/2006 to Laun,   et al.

Title: Transparent, multilayer, biaxially oriented polyester film, and process for its production
Patent Number: 6,866,920 Issued on 03/15/2005 to Janssens,   et al.

Title: Memory storage device carrier having a locking handle
Patent Number: 6,820,953 Issued on 11/23/2004 to Wojcik

Title: Sacrifice read test mode
Patent Number: 6,781,901 Issued on 08/24/2004 to Shore

Title: Modular case for holding articles
Patent Number: 6,820,950 Issued on 11/23/2004 to Sun

Title: Open architecture for a voice user interface
Patent Number: 7,016,847 Issued on 03/21/2006 to Tessel,   et al.

Title: Protective membrane for reconfiguring a workpiece
Patent Number: 6,805,703 Issued on 10/19/2004 to McMorrow

Title: Method and apparatus for preventing a microprocessor from erroneously entering into a test mode during initialization
Patent Number: 7,043,628 Issued on 05/09/2006 to Roche,   et al.

Title: Epitaxially grown compound semiconductor film and compound semiconductor multi-layer structure
Patent Number: 6,815,792 Issued on 11/09/2004 to Nagata,   et al.

Title: Buried, fully depletable, high fill factor photodiodes
Patent Number: 6,815,791 Issued on 11/09/2004 to Dierickx

Title: Storage services and systems
Patent Number: 7,043,614 Issued on 05/09/2006 to Umbehocker,   et al.

Title: Semiconductor memory with floating gate type FET
Patent Number: 6,815,759 Issued on 11/09/2004 to Horiguchi,   et al.

Title: Semiconductor device with alternating conductivity type layer and method of manufacturing the same
Patent Number: 6,815,766 Issued on 11/09/2004 to Miyasaka,   et al.

Title: Field effect transistor with channel extending through layers on a substrate
Patent Number: 6,815,750 Issued on 11/09/2004 to Kamins

Title: Information processing system and cache flash control method used for the same
Patent Number: 7,043,607 Issued on 05/09/2006 to Ezoe

Title: Method for selective trimming of gate structures and apparatus formed thereby
Patent Number: 6,815,737 Issued on 11/09/2004 to Furukawa,   et al.

Title: Silicide bridged anti-fuse
Patent Number: 6,815,797 Issued on 11/09/2004 to Dark,   et al.

Title: Semiconductor electronic device and method of manufacturing thereof
Patent Number: 6,815,789 Issued on 11/09/2004 to Tiziani,   et al.

Title: Semiconductor integrated circuit device incorporating memory cell transistor and logic transistor, and method of manufacturing the same
Patent Number: 6,815,768 Issued on 11/09/2004 to Aochi

Title: Crystalline silicon thin film semiconductor device, crystalline silicon thin film photovoltaic device, and process for producing crystalline silicon thin film semiconductor device
Patent Number: 6,815,788 Issued on 11/09/2004 to Oka,   et al.

Title: Body of a semiconductor material with a reduced mean free path length
Patent Number: 6,815,793 Issued on 11/09/2004 to Kartal,   et al.

Title: Semiconductor integrated circuit device
Patent Number: 6,815,799 Issued on 11/09/2004 to Okawa,   et al.

Title: System with meshed power and signal buses on cell array
Patent Number: 6,815,742 Issued on 11/09/2004 to Kitsukawa,   et al.

Title: Semiconductor device and method of manufacturing the same
Patent Number: 6,815,773 Issued on 11/09/2004 to Uehara,   et al.

Title: Sequential synthesis of core-shell nanoparticles using reverse micelles
Patent Number: 6,773,823 Issued on 08/10/2004 to O'Connor,   et al.

Title: Method for inspecting silicon wafer, method for manufacturing silicon wafer, method for fabricating semiconductor device, and silicon wafer
Patent Number: 6,861,268 Issued on 03/01/2005 to Iwabuchi

Title: Coherence controller for a multiprocessor system, module, and multiprocessor system with a multimodule architecture incorporating such a controller
Patent Number: 7,017,011 Issued on 03/21/2006 to Lesmanne,   et al.

Title: Robust checksums
Patent Number: 7,016,846 Issued on 03/21/2006 to Bruekers,   et al.

Title: Cable tester
Patent Number: 7,002,353 Issued on 02/21/2006 to Lo,   et al.

Title: Toilet bowl odor removal system
Patent Number: 6,795,980 Issued on 09/28/2004 to Ries

Title: Edge profiling for executable program code having branches through stub code segments
Patent Number: 6,795,964 Issued on 09/21/2004 to Ramasamy,   et al.

Title: Distributed feedback type semiconductor laser device
Patent Number: 6,795,466 Issued on 09/21/2004 to Takei,   et al.

Title: Variable bitrate video coding method and corresponding video coder
Patent Number: 6,795,502 Issued on 09/21/2004 to Fert,   et al.

Title: Pallet with a base plate and legs of metal
Patent Number: 6,769,367 Issued on 08/03/2004 to Schutz

Title: Method of using an overlay to verify or form a folding, embossing, or rule die
Patent Number: 6,969,442 Issued on 11/29/2005 to Kerr,   et al.

Title: Syringe device for simultaneous infusion and withdrawal
Patent Number: 7,094,222 Issued on 08/22/2006 to Siekas,   et al.

Title: Flexible member tensioning instruments and methods
Patent Number: 7,094,240 Issued on 08/22/2006 to Molz, IV,   et al.

Title: Medical grafting connectors and fasteners
Patent Number: 7,094,248 Issued on 08/22/2006 to Bachinski,   et al.

Title: Method for transferring a packed data structure to an unpacked data structure by copying the packed data using pointer
Patent Number: 6,865,614 Issued on 03/08/2005 to Fischer,   et al.

Title: Knife selecting arrangement of crop cutting device for use with agricultural machines having a pick-up
Patent Number: 6,912,835 Issued on 07/05/2005 to Chabassier

Title: Nonvolatile memory device having a voltage booster with a discharge circuit activated during standby
Patent Number: 6,836,442 Issued on 12/28/2004 to Micheloni,   et al.

Title: Systems and methods for electrosurgical tissue contraction
Patent Number: 7,094,215 Issued on 08/22/2006 to Davison,   et al.

Title: Receptacle cap having aromatic properties
Patent Number: 7,005,152 Issued on 02/28/2006 to Landau

Title: Device and method for improved serial bus transaction using incremental address decode
Patent Number: 7,013,355 Issued on 03/14/2006 to Chambers

Title: Light frequency locker
Patent Number: 6,795,459 Issued on 09/21/2004 to Tsai

Title: Semiconductor integrated circuit device
Patent Number: 6,977,834 Issued on 12/20/2005 to Onizawa,   et al.

Title: Gas laser
Patent Number: 6,795,462 Issued on 09/21/2004 to Christiansen,   et al.

Title: Process for shutting down a CPU in a SMP configuration
Patent Number: 6,996,745 Issued on 02/07/2006 to Shaylor

Title: Expert-type vehicle steering control system and method
Patent Number: 6,795,763 Issued on 09/21/2004 to Yao,   et al.

Title: Electrode sensor package and application to the skin of a newborn or infant
Patent Number: 6,795,722 Issued on 09/21/2004 to Sheraton,   et al.

Title: Contactable charging type charging device for image formation apparatus, and method of manufacturing the same
Patent Number: 7,123,861 Issued on 10/17/2006 to Eun

Title: Support structure for image processing apparatus
Patent Number: 7,123,856 Issued on 10/17/2006 to Marumoto

Title: Image forming apparatus, image forming apparatus control method, cartridge, and storage medium
Patent Number: 7,123,849 Issued on 10/17/2006 to Ishii,   et al.

Title: Image forming apparatus having positioned cleaning unit for image transfer belt positioned with respect to toner patch detecting member and toner image transfer member
Patent Number: 7,123,852 Issued on 10/17/2006 to Tomizawa

Title: Advanced Bi-directional linear polishing system and method
Patent Number: 6,908,368 Issued on 06/21/2005 to Young,   et al.

Title: System and method of using variable pulses for symbology
Patent Number: 7,123,843 Issued on 10/17/2006 to Melick,   et al.

Title: Systems and methods for improving concept landscape visualizations as a data analysis tool
Patent Number: 6,940,509 Issued on 09/06/2005 to Crow,   et al.

Title: Spout design
Patent Number: 7,000,808 Issued on 02/21/2006 to Schuessler

Title: Flat panel x-ray detector
Patent Number: 7,126,128 Issued on 10/24/2006 to Ikeda,   et al.

Title: Frame transfer prober
Patent Number: 7,126,145 Issued on 10/24/2006 to Ueda

Title: Real-time video radiation exposure monitoring system
Patent Number: 7,126,121 Issued on 10/24/2006 to McGlothlin,   et al.

Title: Polymer electrolyte thin film fuel cell and method of operating the same
Patent Number: 7,081,317 Issued on 07/25/2006 to Fujii,   et al.

Title: Biodegradable common bile duct stent and the method for preparing thereof
Patent Number: 7,094,260 Issued on 08/22/2006 to Jing,   et al.

Title: Fabrication of a high-strength steel article with inclusion control during melting
Patent Number: 7,094,273 Issued on 08/22/2006 to Raymond,   et al.

Title: Physiological total knee implant
Patent Number: 7,094,259 Issued on 08/22/2006 to Tarabichi

Title: Method of an address trace cache storing loop control information to conserve trace cache area
Patent Number: 6,988,190 Issued on 01/17/2006 to Park

Title: Mask with gusset
Patent Number: 6,986,352 Issued on 01/17/2006 to Frater,   et al.

Processing system and method for communicating data Number:7,412,549 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

 
Web LinkGrinder.com

Top Breaking News
     Greek, Cypriot Leaders Resume Unification Talks in Nicosia by Nathan Morley
     Indonesia Tobacco Sales Grow, Raising Health Fears
     South Korea Allows Top Defector to Travel Overseas by VOA News

Title: Processing system and method for communicating data

Abstract: A method for communicating data between an initiator unit (INIT) which initiates the communication and a target unit (TRGT) is described. Therein the initiator unit (INIT) indicates a request (TID) to initiate a communication. In response the target unit (TRGT) provides information (READY, ACCEPTC) indicating whether one of the following situation exist, the initiator unit (INIT) has to maintain the request, the request of the initiator (INIT) is accepted, the request of the initiator (INIT) is rejected. In addition a processing system is described.

Patent Number: 7,412,549 Issued on 08/12/2008 to Radulescu,   et al.


Inventors: Radulescu; Andrei (Eindhoven, NL), Goossens; Kees Gerard Willem (Eindhoven, NL)
Assignee: Koninklijke Philips Electronics N.V. (Eindhoven, NL)
Appl. No.: 10/555,843
Filed: May 4, 2004
PCT Filed: May 04, 2004
PCT No.: PCT/IB2004/050580
371(c)(1),(2),(4) Date: November 03, 2005
PCT Pub. No.: WO2004/100005
PCT Pub. Date: November 18, 2004


Foreign Application Priority Data

May 08, 2003 [EP] 03101266

Current U.S. Class: 710/106 ; 709/237; 710/310
Current International Class: G06F 13/42 (20060101)
Field of Search: 710/106,316-317,310 709/236-237


References Cited [Referenced By]

U.S. Patent Documents
5175733 December 1992 Nugent
5922063 July 1999 Olnowich et al.
6101194 August 2000 Annapareddy et al.
6182183 January 2001 Wingard et al.
6892259 May 2005 Goodrum et al.
2001/0042147 November 2001 Adams et al.
2002/0138717 September 2002 Joy et al.
Foreign Patent Documents
0029961 May., 2000 WO

Other References

Open Core Protocol Specification, International Partnership, 2.0 Release. cited by other .
ISR, Written Opinion of the International Searching Authority, PCT/IB2004/050580. cited by other.

Primary Examiner: Knoll; Clifford H

Claims



The invention claimed is:

1. A method for communicating data between an initiator unit which initiates the communication and a target unit, the method comprising the acts of: the initiator unit indicating a request for a communication thread having a communication thread identifier to initiate a communication; the target unit determining whether the request is accepted or rejected; the target unit determining whether the initiator unit should maintain the request; and the target unit providing information to the initiator unit indicating whether the request is to be maintained, the request is accepted, or the request is rejected, wherein the data is transmitted from the target unit to the initiator unit in accordance with the information, wherein the information is provided by a first signal and a second signal, the first signal indicating the target unit is either ready or not ready, and a second signal indicating the target unit either accepts or rejects the request, the second signal indicating the target unit rejects the request when the first signal indicates that the target unit is not ready.

2. The method according to claim 1, wherein the initiator unit indicates a reference (TID) to a communication thread for which it indicates the request, and wherein the initiator attempts to initiate a communication for another communication thread if the request is rejected.

3. The method according to claim 1, wherein the target unit provides a first and a second signal, the first signal indicating with a first state that the request should be maintained, and indicating with a second state that a second signal is valid, the second signal having a first state indicative that the target unit accepts the selected communication thread, the second state indicating that the initiator should abandon the request.

4. The method according to claim 1, wherein a data consuming unit functions as the initiator.

5. A processing system comprising a first functional unit and a second functional unit, the first functional unit being capable of initiating a communication with the second functional unit using a facility for exchanging signals between the functional units, the signals comprising a request signal by the first functional unit that it desires to initiate a communication, a first information signal by the second functional unit indicative of whether the first functional unit has to maintain the request, and a second information signal indicative of whether the request is accepted, or the request is rejected, wherein the second functional unit determines whether the request is accepted or rejected, wherein the second functional unit determines whether the first functional unit should maintain the request, and wherein data is transmitted from the second functional unit to the first functional unit in accordance with the information signal, wherein the second information signal is set to indicate that the request is rejected when the first information signal indicates that the first functional unit has to maintain the request.

6. The processing system according to claim 5, wherein the first functional unit indicates a reference to a communication thread for which it indicates the request, and wherein the first functional unit attempts to initiate a communication for another communication thread if the request is rejected.

7. The processing system according to claim 5, wherein the first and the second functional unit form part of a network.

8. The method according to claim 1, wherein a validity signal is provided from the initiator unit to the target unit indicating the validity of at least one of the communication thread and the data.

9. The processing system according to claim 6, wherein a validity signal is provided from the first functional unit to the second functional unit indicating the validity of at least one of the communication thread and data being transmitted from the second functional unit to the first functional unit according to the communication thread.

10. The method according to claim 1, wherein the initiator unit and the target unit are provided as part of a network formed on a chip.

11. The processing system according to claim 5, wherein the first functional unit and the second functional unit are part of a network formed on a chip.

12. The method of claim 1, further comprising the act of indicating by the initiator unit to the target unit why the request cannot be granted.

13. The processing system of claim 5, further comprising an additional signal indicating by the initiator unit to the target unit why the request cannot be granted.
Description



The invention relates to a processing system.

The invention further relates to a method for communicating data.

Modern on-chip interconnect protocols such as VCI and OCP introduce communication-thread identifiers to allow multiple unrelated transactions to evolve independently. On each communication thread all the transactions are ordered (i.e., requests are delivered at the slave, responses are issued by the slaves, and responses are delivered to the master in the same order the requests where issued by the master). Transactions with different communication threads do not have any ordering constraints. This allows unrelated communications to proceed independently of each other.

These protocols are defined as split protocols in that transactions are split in a request and a response. After a transmission of a request is completed from a source functional unit to the first intermediate functional unit in a communication path the source functional unit can proceed with a next transmission, instead of having to wait for a response to that request from the destination functional unit. The destination or any intermediate functional unit will start a separate arbitration procedure if necessary to give a response. A split bus protocol is more efficient when a response generation at the slave takes time (because it is pipelined, for example) or if the delivery of the request from the master to the slave takes time (as is often the case in networks). The protocols further allow pipelining, i.e. allow a master to have multiple outstanding requests (i.e., requests waiting for a response). All transactions within the same communication thread are ordered. This implies that requests are executed by the slave in the same order as the requests for those responses were issued by a master, and responses are delivered in the same order as the requests for those responses were issued by a master. Transactions with different communication threads do not have any ordering constraints.

U.S. Pat. No. 6,182,183 provides a link level protocol for exchanging the message between two subsequent functional units in the communication path from the source functional unit to the destination functional unit. According to the known protocol a master functional unit produces information, e.g. a command (Cmd), an address (Addr), or data (DataReq) and at the same time provides an identification of the thread (ReqThreadID) to which the information belongs. Likewise the slave functional unit may provide information (DataResp), and indicate the communication thread to which it belongs by an identification RespThreadID.

A functional unit can be any unit involved in a data stream for example a unit which performs operations on data, such as a CPU, a DSP or a VLIW, or a unit for storing data such as a memory, or a unit for transmitting data such as a router or an interface.

In the sequel the following denotations will be used. An initiator functional unit or initiator is a functional unit which initiates a link-level transaction with another functional unit referred to as target functional unit. According to the OSI definition at the link level, data packets are encoded and decoded into bits. It furnishes transmission protocol knowledge and management and handles errors in the physical layer, flow control and frame synchronization. A source functional unit is denoted as a functional unit which at the network level sends a message, e.g. data or a command to another functional unit, denoted as the destination functional unit. According to the OSI-definition the network layer provides switching and routing technologies, creating logical paths, known as virtual circuits, for transmitting data from node to node. Routing and forwarding are functions of this layer, as well as addressing, internetworking, error handling, congestion control and packet sequencing. A functional unit may operate as a source functional unit or as a destination functional unit depending on the circumstances.

It is a purpose of the invention to improve the known protocol. According therewith a method as defined in claim 1 and a processing system as defined in claim 6 are provided.

According to the invention the target functional unit receiving the request from the initiator functional unit to perform an action relating to a particular thread has the options to signal the initiator functional unit that 1. the initiator unit (INIT) has to maintain the request, 2. the request of the initiator (INIT) is accepted, 3. the request of the initiator (INIT) is rejected.

When the target functional unit rejects the request according to option 3, the initiator is enabled to issue a new request for another or the same communication thread. If this is accepted, a data transmission can take place which otherwise would have been delayed. In this way overall throughput is improved.

The invention is particularly suitable for application in a processor network for the following reasons. Systems on silicon show a continuous increase in complexity due to the ever increasing need for implementing new features and improvements of existing functions. This is enabled by the increasing density with which components can be integrated on an integrated circuit. At the same time the clock speed at which circuits are operated tends to increase too. The higher clock speed in combination with the increased density of components has reduced the area which can operate synchronously within the same clock domain. This has created the need for a modular approach. According to such an approach the processing system comprises a plurality of relatively independent, complex modules. In conventional processing systems the modules usually communicate to each other via a bus. As the number of modules increases however, this way of communication is no longer practical for the following reasons. On the one hand the large number of modules forms a too high bus load. On the other hand the bus forms a communication bottleneck as it enables only one device to send data to the bus. A communication network forms an effective way to overcome these disadvantages. The communication network comprises a plurality of partly connected functional units. Messages from a functional unit are redirected by the functional units to one or more other functional units. Between two directly connected functional units messages relating to different communication threads may be transmitted originating from plural sources and going to plural destinations. According to the method and processing system of the invention the target functional unit has an efficient way to inform the initiator functional unit that a request for a certain thread can not be handled for some time. This enables the initiator functional unit to select another communication thread for which data transmission otherwise should have been unnecessarily delayed.

A message sent by a source functional unit may comprise a command or a packet of data. It is forwarded via one or more intermediate functional units until it arrives at the destination functional unit. The destination functional unit may on its turn send a message to the source functional unit.

These and other aspects of the invention are described in more detail with reference to the drawing. Therein

FIG. 1 shows a processing system comprising plurality of functional units which are coupled in a network,

FIG. 2 shows a typical way of coupling two functional units in a network according to the prior art,

FIG. 3 shows a first and a second mutually coupled functional unit in a first embodiment of the invention,

FIG. 4 shows a first and a second mutually coupled functional unit in a second embodiment of the invention.

FIG. 1 schematically shows a data processing system, which comprises a network connecting a plurality of functional units. The processing system is arranged to transmit data and a communication thread identifier for said data according to a split protocol along a communication path (indicated by arrows) from a source functional unit SFU to a destination functional unit DFU via one or more intermediate functional units IFU1, . . . ,IFU5. By transmitting the data together with a communication thread identifier, multiple unrelated transactions, having mutually different communication thread identifiers can evolve independently.

FIG. 2 shows a typical way of coupling two functional units in a network according to the prior art. Therein a data producing functional unit PFU issues a request to a data consuming functional unit CFU by activating a signal TID. This signal is indicative for the communication thread for which it attempts to transfer data. The data to be transferred is offered at a connection DATA. Validity of the indicated communication thread and the related data is indicated with a further signal VALID. As soon as the data consuming functional unit has handled the request it indicates this with a signal ACCEPTC. Until the data producing functional unit has received this signal no further transmission can take place between the two functional units. It may occur however that a request of the data producing functional unit PFU cannot be handled in time by the data consuming functional unit CFU, for example if the data consuming functional unit CFU has no buffer space left for said thread. This has the consequence however that data transmission between those functional units for all other communication threads are also delayed. In the embodiment shown it is supposed that the initiator is only capable to send data for a particular communication thread. The initiator can indicate this with the TID signal. In practice the initiator may be capable of issuing a plurality of commands, e.g. write, read, conditional write, etc. One or more command signals may be added to enable the initiator to do so, or alternatively the command may be transmitted time multiplexed via another connection, e.g. via the connection used by the TID signal. It is also possible to send only commands.

FIG. 3 shows a first and a second mutually coupled functional units in a first embodiment of a network according to the invention. A data transmission is initiated in the same way as was illustrated with reference to FIG. 2, i.e. the data producing functional unit PFU issues a request to the data consuming functional unit CFU by indicating a communication thread with a signal TID. The data to be transferred is offered at a connection DATA. Validity of the indicated communication thread and the related data is indicated with a further signal VALID. Contrary to the situation illustrated in FIG. 2 however the target functional unit, here the data consuming functional unit, has the following options: 1. Indicating the initiator unit INIT that it has to maintain the request. 2. Indicating that the request of the initiator INIT is accepted. 3. Indicating that the request of the initiator INIT is rejected.

In practice the target functional unit needs time to interpret the request and to determine whether it can be handled at that moment or not. During that time the target functional unit provides an indication according to option 1. This causes the target functional unit to hold the signals TID, DATA and VALID. As soon as the target functional unit has interpreted the request and can handle it, it indicates according to option 2. However if the target functional unit determines that the request can not be handled at that time, for example because a buffer overflow would occur for said communication thread, it signals according to option 3. This allows the initiator to withdraw the request for said communication thread and initiate a transaction for another communication thread which otherwise would have to wait until the earlier request could be handled. In this way the overall communication in the processing system is improved.

In the embodiment of FIG. 3 there is one additional signal that encodes that a link-level data exchange can proceed or it is delayed. With only one additional signal, there is only a proceed/delay feedback possible. This can be generalized to encode more elaborate feedback on why a transaction cannot proceed on a communication thread (when there are multiple causes possible: e.g., empty/full buffers, a process not expecting data on a communication thread is running on a CPU, etc.), or how long transactions can proceed on a communication thread (e.g., there is enough buffering/data to proceed with at least N transactions on a communication thread).

It is noted that a request for a particular communication thread may involve a request for sending commands, addresses and/or other data Alternatively it may involve a request for receiving commands, addresses and/or other data.

FIG. 4 shows a first and a second mutually coupled functional units in a second embodiment of a network according to the invention. Contrary to the embodiment shown in FIG. 3 now the data consuming functional unit CFU serves as the initiator INIT.

The data consuming functional unit CFU as an initiator INIT issues a request to the target, here the data producing functional unit PFU by indicating a communication thread with a signal TID. Validity of the indicated communication thread and the related data is indicated with the signal VALID. As in the embodiment shown in FIG. 3 the target functional unit has the options to 1. Indicating the initiator unit INIT that it has to maintain the request. 2. Indicating that the request of the initiator INIT is accepted. 3. Indicating that the request of the initiator INIT is rejected.

During the time necessary for determining whether the request can be handled the target functional unit responds according to option 1. If the target functional unit determines that it can handle the request on a short term it provides an indication according to option 2. However if it is determined that this impossible, for example because the required data is not expected to become available soon, the target functional unit responds according to option 3. Again this allows the initiator to withdraw the request for said communication thread and initiate a transaction for another communication thread which otherwise would have to wait until the earlier request could be handled. In this way the overall communication in the processing system is improved.

The indications according to the above-mention three options can be provided as follows using the signals READY and ACCEPTP.

TABLE-US-00001 ACCEPTP Option READY ACCEPTC Meaning 1 0 0 (*) The initiator functional unit has to continue indicating the communication thread identifier TID. 2 1 0 The initiator functional unit is requested to indicate an other communication thread identifier. 3 1 1 The indicated communication thread identifier is accepted.

As long as the target functional unit is not ready, indicated by READY=0, the value of the signal ACCEPTP in the embodiment shown FIG. 3 or ACCEPTC in the embodiment of FIG. 4 is irrelevant. However, preferably the signal ACCEPTP or ACCEPTC is kept at a value indicating rejection as long as the target functional unit is not ready to decide between rejection and acceptance. This makes it possible to connect the target functional unit to a conventional initiator functional unit, having no input for receiving the signal READY. In this way the conventional initiator functional unit can normally operate, i.e. wait until the request associated with the indicated communication thread TID is, accepted, regardless whether the waiting is caused by the target functional unit evaluating the request, or because the target functional unit cannot serve the request at that moment. For clarity the logical signal values 1 and 0 were used to indicate a negative and a positive outcome respectively, e.g. ready and not ready, or acceptance or non acceptance. It is clear however that these values could also be used the other way around. Many other alternatives are possible to provide an indication according to one of these options as described in the table. For example by providing the signals READY and ACCEPTC, ACCEPTP serially along one physical connection.

It is remarked that the scope of protection of the invention is not restricted to the embodiments described herein. It is noted that information, e.g. data for a communication thread, information about a communication thread, can be exchanged between the processing units in several ways, e.g. serial, parallel or in a combination of ways.

Neither is the scope of protection of the invention restricted by the reference numerals in the claims. The word `comprising` does not exclude other parts than those mentioned in a claim. The word `a(n)` preceding an element does not exclude a plurality of those elements. Means forming part of the invention may both be implemented in the form of dedicated hardware or in the form of a programmed general purpose processor. The invention resides in each new feature or combination of features.

*


Free Web Sudoku Puzzles.
Solve with your browser.
            1    
8     6       9  
7 1     8 2 6    
4 2         8    
  6   3   8   5  
    8         4 9
    4 2 1     7 3
  9       4     5
    1            
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!