The aim of this research study was to analyse the approaches for establishing a spatial model radial truck tyre, based on finite element method, in order perform realistic analysis static as well dynamic tyre–pavement interactions. A complex rubber tyre having large number elements formulated combining current state-of-the-art modelling techniques and, from that model, simplified smaller derive...

Static-list scheduling algorithms are constructive heuristics with a low complexity and highly useful for design space exploration. In this paper, we present a static-list scheduling algorithm that incorporates a novel topological clustering heuristic. Based on the clustering heuristic, we have developed a simple operation selection function and a combination of two cost functions to determine ...

Recently, high-performance computer architecture has focused on dynamic scheduling techniques to issue and execute multiple operations concurrently. These designs are complex and have frequently shown disappointing performance. A complementary approach is the use of static scheduling techniques to exploit the same parallelism. In this paper we describe some of the tradeoffs between the use of s...

We study the fundamental problem of perfectly secure message transmission (PSMT), where two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as an undirected graph, a part of which may be under the influence of a malicious unbounded computational powerful adversary who can disrupt the communication in variety of ways. S intends to transmit a message ...

In static analysis of queries over trees in the presence of schemas, there is an exponential complexity gap between conjunctive queries (CQs, positive existential first-order formulae without disjunction) and tree patterns (tree-like acyclic CQs). Motivated by applications in XML data management, we consider various restrictions of CQs that bring their complexity down to that of tree patterns. ...

We describe an algebraic technique for performing timing analysis of a class of asyn-chronous circuits described as CSP programs (including Martin's probe operator) with the restrictions that there is no OR-causality and that guard selection is either completely free or mutually exclusive. Such a description is transformed into a safe Petri net. Interval time delays are speciied on the places o...

Understanding the implementation of a certain feature of a system requires identification of the computational units of the system that contribute to this feature. In many cases, the mapping of features to the source code is poorly documented. In this paper, we present a semiautomatic technique that reconstructs the mapping for features that are triggered by the user and exhibit an observable b...

This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs.  2006 Elsevier B.V. All rights reserved.

We present a static analysis that estimates reusable memory cells and a source-level transformation that adds explicit memory-reuse commands into the program text. For benchmark ML programs, our analysis and transformation achieves the memory reuse ratio from 5.2% to 91.3%. The small-ratio cases are for programs that have too prevalent sharings among memory cells. For other cases, our experimen...

In this demonstration, we present the main-memory based streaming XQuery engine GCX which implements novel buffer management strategies that combine static and dynamic analysis to keep main memory consumption low. Depending on the progress made in query evaluation, memory buffers are dynamically purged and minimized. In this demo, we show the various stages in evaluating a practical fragment of...