Obtaining maximum performance from parallel distributed memory machines depends on partitioning parallel programs into modules and scheduling those modules for the shortest possible execution time. The scheduling problem is known to be NP-hard and heuristic algorithms have been proposed to obtain optimal and sub optimal solutions. The partitioning algorithm partitions an application into tasks ...

The Argument Forwarding Queue (AFQ) machine architecture combines the control ow paradigm of Von Neumann machines with the ability of dataaow machines to directly forward data resulting from operations to instructions that use the results. The forwarding capability is used to organize the data operands required by successive instructions into data blocks such that operands for successive instru...

In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study, are a step into the direction of the design of a query optimization strategy that is t for parallel execution of complex queries. Among others, synchronization issues are identiied to limit the performance gain from parallelism. A new hash-join alg...

We study the in-network computation of arbitrary functions whose computation schema is a complete binary tree, i.e., we assume that the network wants to compute a function of K operands, each of which is available at a distinct node in the network, and rather than simply collecting the K operands at a single sink node and computing the function, we want to compute the function during the proces...

Contrary to a widespread assumption, a recent study suggested that adults do not solve very small additions by directly retrieving their answer from memory, but rely instead on highly automated and fast counting procedures (Barrouillet & Thevenot, 2013). The aim of the present study was to test the hypothesis that these automated compiled procedures are restricted to small quantities that do no...

Abstract A transformation of an ordered set M is isotone mapping into . By a representation semigroup S by transformations we mean homomorphism the , i.e. (since semigroup) from preserving operations. We prove that this type leads to “action” on and so introduce notion left operand over Also notions operator pseudoorder between operands show concept pseudoorders plays important role in study ho...

In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a security reduction from LWE over general lattices. General lattices (as opposed to ideal lattices) do not have an inherent multiplicative structure but, using a tensorial product, Aguilar et al. managed ...

This paper discusses trivial computation, where simple operands trivialize potentially complex operations. An example of a trivial operation is integer division, where the divisor is two; the division becomes a simple shift operation. The paper also discusses the concept of redundant computation, where some operation repeatedly does the same function because it repeatedly sees the same operands...

We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF (p) and GF (2). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF (p). The multiplier is scalable, which means that a fixed-area multiplication module can handle operands of any size, and also, t...