Abstract: A method, and associated system, for allocating memory to a first pipeline that includes a sequence of filters. Each filter is configured to execute a process specific to each filter, receive input data, and generate output data. The output data from each filter, except the last filter in the sequence, serves as the input data to the next filter in the sequence. An optimum memory capacity is allocated to the first pipeline if possible. Otherwise, a guaranteed memory bandwidth is allocated to the first pipeline if possible. Otherwise, extra memory currently allocated to a second pipeline is currently released if the second pipeline not currently performing processing or subsequently released when the second pipeline subsequently completes performing processing that is currently being performed, followed by allocating the extra memory to the first pipeline.

Abstract: In a parallel computing system having a plurality of computing node groups including at least one spare computing node group, a plurality of managing nodes for allocating jobs to the computing node groups and an information management server having respective computing node group status information are associated with the computing node groups, and the respective managing nodes update respective in-use computing node group status information by accessing the information management server. Furthermore, when the managing node detects an occurrence of a failure, the managing node having used then the computing node group disabled due to the failure identifies a spare computing node group by accessing the computing node group status information in the information management server. Then, the managing node having used then the disabled computing node group obtains the computing node group information of the identified spare computing node group.

Abstract: A system, and methods of operation thereof, is presented that permits determination of a defect in an inspection subject by means of processing an image of said inspection subject, which system avoids exhaustion of bandwidth in a communication line connected to the image processing unit. The system includes a unit to receive an image, a transmission queue and a buffer to store the image, an image processing unit to determine whether the image includes a defect image, a unit that generates defect information when the presence of a defect image is determined, an image extraction unit that extracts the defect image based on the defect information, and a storage unit for storing such defect image.

Abstract: A situation is circumvented where wireless communication becomes impossible in a wireless LAN system under the influence of a blocking object, noise caused by an electromagnetic wave, or the like. A wireless LAN system comprises: a relay which can communicate with an external system; a master which can communicate with the relay; and a plurality of slaves which can wirelessly communicate with the master, the plurality of slaves including a first group and a second group, the first group comprising an alternative slave having a function of transmitting, when a portion of the slaves cannot receive a synchronization signal from the master, an information signal received from the master to the portion of slaves, and the second group comprising non-alternative slaves and not having the function of transmitting the information signal to the portion of slaves.

Abstract: This solution relates to machine vision computing environments, and more specifically relates to a system and method for selectively accelerating the execution of image processing applications using a cell computing system. The invention provides a high performance machine vision system over the prior art and provides a method for executing image processing applications on a Cell and BPE3 image processing system. Moreover, implementations of the invention provide a machine vision system and method for distributing and managing the execution of image processing applications at a fine-grained level via a PCIe connected system. The hybrid system is replaced with the BPE3 and the switch is also eliminated from the prior in order to meet over 1 GB processing requirement.

Abstract: A method, and associated system, for allocating memory to a first pipeline that includes a sequence of filters. Each filter is configured to execute a process specific to each filter, receive input data, and generate output data. The output data from each filter, except the last filter in the sequence, serves as the input data to the next filter in the sequence. An optimum memory capacity is allocated to the first pipeline if possible. Otherwise, a guaranteed memory bandwidth is allocated to the first pipeline if possible. Otherwise, extra memory currently allocated to a second pipeline is currently released if the second pipeline not currently performing processing or subsequently released when the second pipeline subsequently completes performing processing that is currently being performed, followed by allocating the extra memory to the first pipeline.

Abstract: A system, and methods of operation thereof, is presented that permits determination of a defect in an inspection subject by means of processing an image of said inspection subject, which system avoids exhaustion of bandwidth in a communication line connected to the image processing unit. The system includes a unit to receive an image, a transmission queue and a buffer to store the image, an image processing unit to determine whether the image includes a defect image, a unit that generates defect information when the presence of a defect image is determined, an image extraction unit that extracts the defect image based on the defect information, and a storage unit for storing such defect image.

Abstract: A path controller 10 creates a logical tree LT having a plurality of member trees MT1 and MT2 within a routing table 52 at the time of initial setting. Direct tables DT1 and DT2 for the member trees MT1 and MT2 have the same DT entries (root). Unlike a conventional tree in which a single tree is constructed for the same root, since the present invention is such that the plurality of member trees are constructed for the same root, the number of nodes N passed through before reaching leaves L is reduced. At the time of path search, a plurality of search engines SE1 and SE2 search the member trees MT1 and MT2, respectively.

Abstract: A situation is circumvented where wireless communication becomes impossible in a wireless LAN system under the influence of a blocking object, noise caused by an electromagnetic wave, or the like. A wireless LAN system comprises: a relay which can communicate with an external system; a master which can communicate with the relay; and a plurality of slaves which can wirelessly communicate with the master, the plurality of slaves including a first group and a second group, the first group comprising an alternative slave having a function of transmitting, when a portion of the slaves cannot receive a synchronization signal from the master, an information signal received from the master to the portion of slaves, and the second group comprising non-alternative slaves and not having the function of transmitting the information signal to the portion of slaves.

Abstract: This solution relates to machine vision computing environments, and more specifically relates to a system and method for selectively accelerating the execution of image processing applications using a cell computing system. The invention provides a high performance machine vision system over the prior art and provides a method for executing image processing applications on a Cell and BPE3 image processing system. Moreover, implementations of the invention provide a machine vision system and method for distributing and managing the execution of image processing applications at a fine-grained level via a PCIe connected system. The hybrid system is replaced with the BPE3 and the switch is also eliminated from the prior in order to meet over 1 GB processing requirement.

Abstract: To provide a path controller capable of reducing path search time. A path controller 10 creates a logical tree LT having a plurality of member trees MT1 and MT2 within a routing table 52 at the time of initial setting. Direct tables DT1 and DT2 for the member trees MT1 and MT2 have the same DT entries (root). Unlike a conventional tree in which a single tree is constructed for the same root, since the present invention is such that the plurality of member trees are constructed for the same root, the number of nodes N passed through before reaching leaves L is reduced. At the time of path search, a plurality of search engines SE1 and SE2 search the member trees MT1 and MT2, respectively.

Abstract: A path controller 10 creates a logical tree LT having a plurality of member trees MT1 and MT2 within a routing table 52 at the time of initial setting. Direct tables DT1 and DT2 for the member trees MT1 and MT2 have the same DT entries (root). Unlike a conventional tree in which a single tree is constructed for the same root, since the present invention is such that the plurality of member trees are constructed for the same root, the number of nodes N passed through before reaching leaves L is reduced. At the time of path search, a plurality of search engines SE2 search the member trees MT1 and MT2, respectively.

Abstract: In a parallel computing system having a plurality of computing node groups including at least one spare computing node group, a plurality of managing nodes for allocating jobs to the computing node groups and an information management server having respective computing node group status information are associated with the computing node groups, and the respective managing nodes update respective in-use computing node group status information by accessing the information management server. Furthermore, when the managing node detects an occurrence of a failure, the managing node having used then the computing node group disabled due to the failure identifies a spare computing node group by accessing the computing node group status information in the information management server. Then, the managing node having used then the disabled computing node group obtains the computing node group information of the identified spare computing node group.

Abstract: To provide a path controller capable of reducing path search time. A path controller 10 creates a logical tree LT having a plurality of member trees MT1 and MT2 within a routing table 52 at the time of initial setting. Direct tables DT1 and DT2 for the member trees MT1 and MT2 have the same DT entries (root). Unlike a conventional tree in which a single tree is constructed for the same root, since the present invention is such that the plurality of member trees are constructed for the same root, the number of nodes N passed through before reaching leaves L is reduced. At the time of path search, a plurality of search engines SE1 and SE2 search the member trees MT1 and MT2, respectively.