Abstract:
Three modular arrays structured from a common module are connected together a first way to form a binary quotient by successive approximations, or a second way to form a binary product. Any one of the three modular arrays may be used to add or subtract two binary numbers. To divide, one array is utilized to effectively form the reciprocal of the binary divisor, most significant bit first, by successive approximation. Control circuitry, including a carry detector, dictates the formation of the shift and add sequence that effectively represents the reciprocal of the divisor by controlling the positioning of the divisor before each addition step so that the product is a series of binary ones. The add and shift sequence utilized to generate the series of binary ones, as it is evolving, is also being utilized to manipulate the dividend, thereby forming the quotient, most significant bit first. In effect, the dividend is being multiplied by the reciprocal of the divisor so as to form an approximate product of the dividend and reciprocal of the divisor, most significant bit first. This product is actually an increasingly precise approximation of the quotient of the dividend and divisor. The binary product of two numbers is formed, most significant bit first, by manipulating the multiplicand according to an add and shift sequence determined by use of the multiplier.
Abstract:
The bits of the multiplier are multiplied by sequential bits of the multiplicand in ascending order of significance. These sequential products are supplied to a parallel adder, where each bit is added to the delayed sum of the preceding operation of the next higher bit in order of significance, including the carry bit as the most significant. After k bits of multiplicand have been used, truncated or rounded output becomes available at the output of the least significant stage of the adder. During the bit interval of the last bit of the multiplicand the outputs of the adder are loaded into a parallel input series output shift register, after which the remaining bits of the product are taken from the output of the shift register, the delayed flipflops associated with the adder are cleared and the adder begins to operate on the next multiplication while the shift register is unloading.
Abstract:
A two''s complement negative number multiplying circuit in which no complementing of the multiplier or multiplicand is required, no special cases need be detected, no complementing of the result is required and fewer transfer paths are needed.
Abstract:
The embodiments herein develop a system for providing hierarchical cache for big data processing. The system comprises a caching layer, a plurality of actors in communication with the caching layer, a machine hosting the plurality of actors, a plurality of replication channels in communication with the plurality of actors, a predefined ring structure. The caching layer is a chain of memory and storage capacity elements, configured to store a data from the input stream. The plurality of actors is configured to replicate the input data stream and forward the replicated data to the caching layer. The replication channels are configured to forward the replicated data from a particular actor to another actor. The predefined ring structure maps the input data to the replica actors.