Abstract: A one-piece fitting (56) for a stiffened panel (51) comprising a panel body (52) with a plurality of stiffeners (53, 54, 55) arranged thereon, the fitting comprising a fitting body (56) configured to be fastened, in use, to two or more of the stiffeners (53, 54, 55) so as to provide a junction to transfer load between the two or more stiffeners, wherein the fitting body further comprises an integral functional fitting (57) arranged for engagement with a component other than the stiffened panel.

Abstract: Systems and methods are disclosed to implement a request routing layer of a service provider system, where the request routers are aware of different versions of a service implemented by the servers of the system. In embodiments, the request routers may discover the different versions of the service via periodic health messages or request responses from the servers. Requests are routed to the servers according to a routing policy that specifies the relative proportions of requests that are to be routed to each version. Version metrics generated from the requests may be captured and provided to a version change manager, which may update the routing policy based on the metrics, either increasing or decreasing the proportion of requests for the different versions. In embodiments, the request router may implement additional rules that control their routing behavior in response to detected error conditions.

Abstract: A sawmill includes a four-stroke internal combustion engine having an output shaft for driving a sawblade. The output shaft has a longitudinal axis. The engine is mounted on the sawmill for rotation between a first operative position with the longitudinal axis of the output shaft extending at a first angle, and a second operative position with the longitudinal axis of the output shaft extending at a second angle transversely to the first angle. The engine has fuel injection to facilitate operation in the first and second operative positions and a lubrication system incorporating a wet sump. An oil pick up for the lubrication system is configured to pick up oil from the wet sump at both the first and second operative positions.

Abstract: Systems and methods are disclosed to implement a request routing layer of a service provider system, where the request routers are aware of different versions of a service implemented by the servers of the system. In embodiments, the request routers may discover the different versions of the service via periodic health messages or request responses from the servers. Requests are routed to the servers according to a routing policy that specifies the relative proportions of requests that are to be routed to each version. Version metrics generated from the requests may be captured and provided to a version change manager, which may update the routing policy based on the metrics, either increasing or decreasing the proportion of requests for the different versions. In embodiments, the request router may implement additional rules that control their routing behavior in response to detected error conditions.

Abstract: A system includes access controls that allow or deny a request based at least in part on a context associated with the request. A service receives a request from a client, and forwards information that describes the request and the context of the request to a context management service. The context management service determines whether the request should be allowed by querying a set of context validation plugins. Each context validation plugin analyzes particular characteristics of a request's context, and based at least in part on the request's context, indicates to the context management service that the request should be allowed or denied. If a quorum of the context validation plugins indicate to the context management service that the request should be allowed, the context management service indicates to the service that the request is allowed within the provided context.

Abstract: Systems and methods are disclosed to implement a request routing layer of a service provider system, where the request routers are aware of different versions of a service implemented by the servers of the system. In embodiments, the request routers may discover the different versions of the service via periodic health messages or request responses from the servers. Requests are routed to the servers according to a routing policy that specifies the relative proportions of requests that are to be routed to each version. Version metrics generated from the requests may be captured and provided to a version change manager, which may update the routing policy based on the metrics, either increasing or decreasing the proportion of requests for the different versions. In embodiments, the request router may implement additional rules that control their routing behavior in response to detected error conditions.

Abstract: A system includes access controls that allow or deny a request based at least in part on a context associated with the request. A service receives a request from a client, and forwards information that describes the request and the context of the request to a context management service. The context management service determines whether the request should be allowed by querying a set of context validation plugins. Each context validation plugin analyzes particular characteristics of a request's context, and based at least in part on the request's context, indicates to the context management service that the request should be allowed or denied. If a quorum of the context validation plugins indicate to the context management service that the request should be allowed, the context management service indicates to the service that the request is allowed within the provided context.

Abstract: A sawmill includes a four-stroke internal combustion engine having an output shaft for driving a sawblade. The output shaft has a longitudinal axis. The engine is mounted on the sawmill for rotation between a first operative position with the longitudinal axis of the output shaft extending at a first angle, and a second operative position with the longitudinal axis of the output shaft extending at a second angle transversely to the first angle. The engine has fuel injection to facilitate operation in the first and second operative positions and a lubrication system incorporating a wet sump. An oil pick up for the lubrication system is configured to pick up oil from the wet sump at both the first and second operative positions.

Abstract: A sawmill includes a four-stroke internal combustion engine having an output shaft for driving a sawblade. The output shaft has a longitudinal axis. The engine is mounted on the sawmill for rotation between a first operative position with the longitudinal axis of the output shaft extending at a first angle, and a second operative position with the longitudinal axis of the output shaft extending at a second angle transversely to the first angle. The engine has fuel injection to facilitate operation in the first and second operative positions and a lubrication system incorporating a wet sump. An oil pick up for the lubrication system is configured to pick up oil from the wet sump at both the first and second operative positions.

Abstract: A sawmill includes a four-stroke internal combustion engine having an output shaft for driving a sawblade. The output shaft has a longitudinal axis. The engine is mounted on the sawmill for rotation between a first operative position with the longitudinal axis of the output shaft extending at a first angle, and a second operative position with the longitudinal axis of the output shaft extending at a second angle transversely to the first angle. The engine has fuel injection to facilitate operation in the first and second operative positions and a lubrication system incorporating a wet sump. An oil pick up for the lubrication system is configured to pick up oil from the wet sump at both the first and second operative positions.

Abstract: An anti-bounce device (100) for a saw mill, the device including a strut (60) having a first end piece (50), a second end piece (51) and a resilient member (52) therebetween, the first end piece of the strut being moveable relative to the second end piece; an engagement means (40) associated with the strut (60) adapted to move across a surface of a material to be sawn, the engagement means (40) transferring force to the first end piece (50) of the strut and the resilient member (52) of the strut dampening relative movement between the first end piece (50) and the second end piece (51) of the strut thereby restraining movement of the engagement means (40) relative to the surface of the material to be saw, and connection means (70,80) for connecting the strut to the saw mill.

Abstract: An anti-bounce device (100) for a saw mill, the device including a strut (60) having a first end piece (50), a second end piece (51) and a resilient member (52) therebetween, the first end piece of the strut being moveable relative to the second end piece; an engagement means (40) associated with the strut (60) adapted to move across a surface of a material to be sawn, the engagement means (40) transferring force to the first end piece (50) of the strut and the resilient member (52) of the strut dampening relative movement between the first end piece (50) and the second end piece (51) of the strut thereby restraining movement of the engagement means (40) relative to the surface of the material to be saw, and connection means (70,80) for connecting the strut to the saw mill.

Abstract: A method and apparatus for performing pipelined computations that include cross-iteration computations. The apparatus includes a functional unit having at least one input and an output, each input being operable to receive an input data value and an associated input data validity tag indicative of the validity of the input data value and the output being operable to provide an output data value and an associated output data validity tag indicative of the validity of the output data value. The first functional unit is operable in a first mode in which an output data value from the first functional unit is valid if all of the input data values are valid, and in a second mode in which the output data value from the first functional unit is valid if any of the input data values is valid.

Abstract: Various load and store instructions may be used to transfer multiple vector elements between registers in a register file and memory. A cnt parameter may be used to indicate a total number of elements to be transferred to or from memory, and an rcnt parameter may be used to indicate a maximum number of vector elements that may be transferred to or from a single register within a register file. Also, the instructions may use a variety of different addressing modes. The memory element size may be specified independently from the register element size such that source and destination sizes may differ within an instruction. With some instructions, a vector stream may be initiated and conditionally enqueued or dequeued. Truncation or rounding fields may be provided such that source data elements may be truncated or rounded when transferred. Also, source data elements may be sign- or unsigned-extended when transferred.

Abstract: A re-configurable, streaming vector processor (100) is provided which includes a number of function units (102), each having one or more inputs for receiving data values and an output for providing a data value, a re-configurable interconnection switch (104) and a micro-sequencer (118). The re-configurable interconnection switch (104) includes one or more links, each link operable to couple an output of a function unit (102) to an input of a function unit (102) as directed by the micro-sequencer (118). The vector processor may also include one or more input-stream units (122) for retrieving data from memory. Each input-stream unit is directed by a host processor and has a defined interface (116) to the host processor. The vector processor also includes one or more output-stream units (124) for writing data to memory or to the host processor. The defined interface of the input-stream and output-stream units forms a first part of the programming model.

Abstract: A method for scheduling a computation for execution on a computer with a number of interconnected functional units. The computation is representable by a data-flow graph with a number of nodes connected by edge. A loop-period of the computation is calculated and the nodes are scheduled for throughput by assigning an execution cycle and a functional unit to each node of the data-flow graph. The scheduling of flexible nodes is adjusted to minimize the number of interconnections required in each execution cycle. The edges of the data-flow graph are allocated to one or more of the interconnections between functional units. The scheduling method may be used, for example, to optimize the interconnection fabric design for an ASIC or as part of a compiler for a re-configurable streaming vector processor.

Abstract: A method for producing a formatted description of a computation representable by a data-flow graph and computer for performing a computation so described. A source instruction is generated for each input of the data-flow graph, a computational instruction is generated for each node of the data-flow graph, and a sink instruction is generated for each output of the data-flow graph. The computational instruction for a node includes a descriptor of an operation performed at the node and a descriptor of each instruction that produces an input to the node. The formatted description is a sequential instruction list comprising source instructions, computational instructions and sink instructions. Each instruction has an instruction identifier and the descriptor of each instruction that produces an input to the node is the instruction identifier. The computer is directed by a program of instructions to implement a computation representable by a data-flow graph.

Abstract: An interconnection device (300) with a number of links (306, 308, 310, 312 and 314), each link having a number of link input ports (302), link output ports (304) and storage registers (316). An input selection switch (402) is coupled to a selected link input port to receive an input data token. The storage registers (316) may be used to store input data tokens. A storage access switch (404) is coupled to the input selection switch (402) and to the storage registers (316) and may be used to select the current input data token or a token from the storage registers as an output data token. An output selection switch (406) receives the output data token and provides it to a selected link output port. The interconnection device may, for example, be used to connect the inputs and outputs of the processing elements of a vector processor or digital signal processor.

Abstract: A method for scheduling a computation for execution on a computer with a number of interconnected functional units. The computation is representable by a data-flow graph with a number of nodes connected by edge. A loop-period of the computation is calculated (104) and the nodes are scheduled for throughput (106) by assigning an execution cycle and a functional unit to each node of the data-flow graph. The scheduling of flexible nodes is adjusted to minimize the number of interconnections required in each execution cycle (110). The edges of the data-flow graph are allocated (122) to one or more of the interconnections between functional units. The scheduling method may be used, for example, to optimize the interconnection fabric design for an ASIC or as part of a compiler for a re-configurable streaming vector processor.

Abstract: A method for producing a formatted description of a computation representable by a data-flow graph and computer for performing a computation so described. A source instruction is generated for each input (502, 522) of the data-flow graph, a computational instruction is generated for each node (506, 510, 514 etc) of the data-flow graph, and a sink instruction is generated for each output (520, 540) of the data-flow graph. The computation instruction for a node includes a descriptor of the operation performed at the node and a descriptor of each instruction that produces an input to the node. The formatted description is a sequential instruction list (A, B, C, . . . , J, K, L, FIG. 2) comprising source instructions, computational instructions and sink instructions. Each instruction has an instruction identifier and the descriptor of each instruction that produces an input to the node is the instruction identifier.