최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0621860 (2009-11-19) |
등록번호 | US-8281265 (2012-10-02) |
우선권정보 | DE-102 36 269 (2002-08-07); DE-102 36 271 (2002-08-07); DE-102 36 272 (2002-08-07); WO-PCT/EP2002/010065 (2002-08-16); DE-102 38 172 (2002-08-21); DE-102 38 173 (2002-08-21); DE-102 38 174 (2002-08-21); DE-102 40 000 (2002-08-27); DE-102 40 022 (2002-08-27); WO-PCT/DE2002/003278 (2002-09-03); DE-102 41 812 (2002-09-06); WO-PCT/EP2002/010084 (2002-09-09); DE-102 43 322 (2002-09-18); WO-PCT/EP2002/010464 (2002-09-18); WO-PCT/EP2002/010479 (2002-09-18); WO-PCT/EP2002/010536 (2002-09-19); WO-PCT/EP2002/010572 (2002-09-19); EP-02022692 (2002-10-10); EP-02027277 (2002-12-06); DE-103 00 380 (2003-01-07); WO-PCT/DE2003/000152 (2003-01-20); WO-PCT/EP2003/000624 (2003-01-20); WO-PCT/DE2003/000489 (2003-02-18); DE-103 10 195 (2003-03-06); WO-PCT/DE2003/000942 (2003-03-21); DE-103 15 295 (2003-04-04); EP-03009906 (2003-04-30); DE-103 21 834 (2003-05-15); EP-03013694 (2003-06-17); EP-03015015 (2003-07-02) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 4 인용 특허 : 543 |
In a system including a multidimensional field of reconfigurable elements, and a method for operating said field of reconfigurable elements, one or more groups of said elements suitable for processing a predetermined task may be determined, a particular one of the one or more groups is selected, and
In a system including a multidimensional field of reconfigurable elements, and a method for operating said field of reconfigurable elements, one or more groups of said elements suitable for processing a predetermined task may be determined, a particular one of the one or more groups is selected, and the selected group is configured in a predetermined manner during runtime for processing the predetermined task, and in manufacturing of said system.
1. A method for, in an array of hardwire connected hardware components, dynamic bus setup of a communication connection between a sending one of the hardware components and a receiving one of the hardware components one of the sending hardware component and the receiving hardware component being ini
1. A method for, in an array of hardwire connected hardware components, dynamic bus setup of a communication connection between a sending one of the hardware components and a receiving one of the hardware components one of the sending hardware component and the receiving hardware component being initially considered as a starting component and the other of the sending hardware component and the receiving hardware component being considered as a target component, the method comprising: iteratively performing the following until at least one of a plurality of possible paths between the sending hardware component and the receiving hardware component is completed, each of the plurality of possible paths being defined by a respective sequence of transmission from the sending hardware component, to the receiving hardware component, and through a respective set of other ones of the hardware components of the array that are, with respect to the sequence of transmission, between the sending and receiving hardware components: for each starting component: (i) sending, by the respective starting component, an inquiry to each of a respective plurality of hardware components of the array that neighbor the respective starting component for requesting participation of the neighboring component in the setup of the communication connection; and(ii) for each of the neighboring components of the respective starting component, responsive to the inquiry, assigning a respective code number to the respective neighboring component conditional upon that the respective neighboring component is determined to be available for the participation, the assignment of the code rendering the respective neighboring component unavailable in subsequent iterations;wherein, for each of the iterations after the first iteration, each of the components that had been assigned a respective code number in step (ii) of the immediately preceding iteration is considered as a new starting component. 2. The method according to claim 1, wherein: the at least one of the plurality of possible paths include a plurality of completed paths; andfor each of the completed paths, the code numbers assigned to the hardware components of the respective path differ from each other. 3. The method according to claim 2, wherein, for each one of the plurality of completed paths: a code number assigned to a first one of the components of the path that sequentially follows a second one of the components of the path is determined by one of incrementing and decrementing a code number assigned to the second one of the components by a fixed amount; andthe assigned code numbers indicate a number of components traversed from the initial starting component until the components to which the code numbers have been assigned. 4. The method according to claim 3, wherein the one of incrementing and decrementing is performed by a cyclic counting, each cycle including at least three numbers. 5. The method according to claim 1, wherein after the setup of communication connection, all those of the components that had been considered as starting components during the iterations and that are not needed for the communication connection are freed. 6. The method according to claim 5, wherein the not needed components being freed are freed by: marking those of the components that had been considered as starting components after the first iteration as needed; andsending a global release signal for release of all those of the components that had been considered as starting components after the first iteration and that are not marked. 7. The method according to claim 1, wherein the setup of the communication connection is considered complete as soon as the target component is reached from the initial starting component. 8. The method according to claim 7, wherein a setup of additional communication connections between the initial starting component and the target component is suppressed responsive to the setup of the communication connection being considered complete. 9. The method according to claim 7, wherein a notification is transmitted to the components that have participated in the setup of the communication connection, the notification indicating that the communication connection has been set up. 10. The method according to claim 9, wherein the notification is transmitted by transmitting a bus sharing signal from the target component to the components that had been considered as starting components in an iterative process that is in a reverse direction of the iterative process used to complete the at least one of the plurality of possible paths. 11. The method according to claim 10, wherein the components that have participated in the setup of the communication connection are identified by analyzing code numbers assigned to each component of a plurality of paths, each of the plurality of paths including a plurality of sequentially following components beginning at the target component. 12. The method according to claim 11, wherein, beginning from the initial starting component, code numbers are assigned to each successive component by incrementing a code number assigned to a previous component, the method further comprising: after reaching the target component, identifying as belonging to the communication connection a plurality of components that have been assigned code numbers of smallest values. 13. The method according to claim 1, further comprising: beginning at the target component and tracing back to each starting component until reaching the initial starting component, gradually releasing according to a progression of the trace, each component that is not needed for the communication connection, wherein a component to be freed is released by sending a release signal to the component to be freed via a component that had previously inquired about an availability of the component to be freed. 14. The method according to claim 1, wherein a plurality of communication connections are set up simultaneously, the method further comprising: assigning a directional value to each of a plurality of components addressed for setting up a communication connection, the directional value indicating a direction from which one of the inquiries had been obtained; andstoring in each of the plurality of addressed components its assigned directional value. 15. The method according to claim 14, further comprising: performing a bus verification by analyzing the assigned directional values of each of the plurality of addressed components. 16. The method according to claim 1, wherein the at least one of the plurality of possible paths includes a plurality of paths that include an equal number of components as each other, the method further comprising:selecting for the communication connection one of the plurality of paths on the basis of an evaluation criterion that one of has been assigned and is assignable to the particular path. 17. The method according to claim 16, wherein the evaluation criterion includes at least one of a number of components running horizontally through the particular path, a number of components running vertically through the particular path, a number of components of the particular path that include registers, a connection density of existing path connections along the components of the particular path, and a number of remaining free components not distributed by the particular path. 18. A method for, in an array of hardwire connected hardware components, dynamic setup of a communication connection between a sending one of the hardware components and a receiving one of the hardware components, one of the sending hardware component and the receiving hardware component being initially considered as a starting component and the other of the sending hardware component and the receiving hardware component being considered as a target component, the method comprising: iteratively performing the following until at least one of a plurality of possible paths between the sending hardware component and the receiving hardware component is completed, each of the plurality of possible paths being defined by a respective sequence of transmission from the sending hardware component, to the receiving hardware component, and through a respective set of other ones of the hardware components of the array that are, with respect to the sequence of transmission, between the sending and receiving hardware components: for each starting component: (i) sending, by the respective starting component, an inquiry to each of a respective plurality of hardware components of the array that neighbor the respective starting component for requesting participation of the neighboring component in the setup of the communication connection; and(ii) for each of the neighboring components of the respective starting component, responsive to the inquiry, assigning a respective code number to the respective neighboring component conditional upon that the respective neighboring component is determined to be available for the participation, the assignment of the code rendering the respective neighboring component unavailable in subsequent iterations;wherein, for each of the iterations after the first iteration, each of the components that had been assigned a respective code number in step (ii) of the immediately preceding iteration is considered as a new starting component. 19. The method according to claim 18, wherein, subsequent to, and based on, the completion of the at least one of the plurality of possible paths is completed, transmission from the sending hardware component to the receiving hardware component is performed along a selected one of the at least one of the plurality of possible paths. 20. The method according to claim 18, wherein, for each of the components to which a respective code is assigned during step (ii), the assigned code indicates at least one of (a) a number of rows of the array between the respective component to which the code has been assigned and the initial starting component and (b) a number of columns of the array between the respective component to which the code has been assigned and the initial starting component. 21. The method according to claim 18, wherein hardware functions of the hardwire connected hardware components are reconfigurable during runtime.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.