Abstract: When performing “time warp slice” rendering for a virtual reality display, the application rendering (30) of the images required for the application that requires the virtual reality display is synchronised (35) to the display frame rate and treated as a “normal” priority task (51) in terms of its scheduling on a host processor. The time warp slice rendering (50) to render the time warp “slices” into the display buffer (21) of the display (4) for scanning out (23) as the display panel is being refreshed is effected as a “real time” priority task (58). To do this, the rendering task setup processing that must be performed on the host processor for that rendering task is scheduled using an earliest deadline first scheduling policy and is synchronised (52) to specific, recurring display events (53) that allow the “real time” priority time warp slice rendering task setup processing on the host processor to be triggered at specific points in the scan out period (23) of the display (4).

Abstract: The present invention provides a technique for efficiently looking up address-routing information in an intermediate network node, such as a router. To that end, the node locates routing information stored in its memory using one or more “lookup” tables (LUT) which can be searched using a small, bounded number of dependent lookups, thereby reducing the number of dependent lookups conventionally performed. The LUTs are arranged so each table provides routing information for network addresses whose subnet mask lengths are within a different range (“stride”) of mask lengths. According to the technique, the node locates a network address's routing information by searching the LUTs, in order of decreasing prefix lengths, until the routing information is found. Preferably, several tables are searched in parallel. A match in a LUT may further point to a small MTRIE that enables the final bits of a prefix to be matched. That final MTRIE is searched using a relatively small, bounded number of dependent lookups.

Abstract: The present invention provides a technique for efficiently looking up address-routing information in an intermediate network node, such as a router. To that end, the node locates routing information stored in its memory using one or more “lookup” tables (LUT) which can be searched using a small, bounded number of dependent lookups, thereby reducing the number of dependent lookups conventionally performed. The LUTs are arranged so each table provides routing information for network addresses whose subnet mask lengths are within a different range (“stride”) of mask lengths. According to the technique, the node locates a network address's routing information by searching the LUTs, in order of decreasing prefix lengths, until the routing information is found. Preferably, several tables are searched in parallel. A match in a LUT may further point to a small MTRIE that enables the final bits of a prefix to be matched.