374,302 research outputs found
A comprehensive lightweight inter-domain procedure call mechanism for concurrent computations
Many inter-domain procedure calls (IDPCs) have been developed to provide fast communication services between protection domains. Different techniques have been employed to trade protection for performance. However, few studies have been made to discuss issues for constructing a comprehensive and generally usable IDPC facility. In this paper, we evaluate the tradeoff between protection and performance in a IDPC facility, and introduce a new IDPC mechanism which shows its merits by achieving comprehensiveness with secure protection and a performance that is comparable with some well-known mechanisms.published_or_final_versio
A general method for dynamic analysis of structures overview
The presented research deals with the development of a dynamic analysis method for structural systems. The modeling approach is essentially a finite element method in the sense that the structure is divided into n elements. An element is defined as any structural unit whose degree of freedom (dofs) can be categorized as either interface or non-interface dofs. An element could be a fundamental unit such as a rod, a beam, a plate etc., or it could be an entire structural component. Furthermore, the parameters for the element could be distributed or lumped. The choice of elements is totally arbitrary and is a matter of user convenience. In particular, issues of accuracy and convergence do not enter on the level of example that bookkeeping is reduced to a minimum. Each element is modeled using a set of interface constraint modes (ICM) combined with a set of interface restrained normal models (IRNM). The next step is the solution of the system eigenvalue problem. The procedure calls for the sequential solution of a number of small eigenvalue problems based on a truncation principle for IRNM. In addition, the form of these eigenvalue problems is very simple such that an escalator type of eigenvalue problem solver can be used which is extremely cost-effective and fast
Recommended from our members
Constant-time cost evaluation for behavioral partitioning
Given a system behavioral specification, partitioning can be used to distribute among chips the processes, procedures, and storage elements that comprise the specification. We introduce a technique for constant-time recomputation of pin, area, and execution-time estimates for a behavioral partitioning move. The technique permits fast, accurate estimations of a large number of partitionings, thus enabling better results than approaches which attain tractable computation time by using gross estimates or less thorough partitioning algorithms. The key to our technique is the isolation and extraction before partitioning of the basic design attributes needed for estimation, and the updating of this information in constant-time for each move. The estimation models are almost as detailed as those presented in previous estimation approaches not intended for constant-time update. The results we provide indicate the speed and practicality of our estimation approach in conjunction with sophisticated partitioning algorithms
Asymptotically near-optimal RRT for fast, high-quality, motion planning
We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based
algorithm that is asymptotically near-optimal. Namely, the solution extracted
from LBT-RRT converges to a solution that is within an approximation factor of
1+epsilon of the optimal solution. Our algorithm allows for a continuous
interpolation between the fast RRT algorithm and the asymptotically optimal
RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no
approximation is allowed), LBT-RRT behaves like RRG. When the approximation
factor is unbounded, LBT-RRT behaves like RRT. In between, LBT-RRT is shown to
produce paths that have higher quality than RRT would produce and run faster
than RRT* would run. This is done by maintaining a tree which is a sub-graph of
the RRG roadmap and a second, auxiliary graph, which we call the lower-bound
graph. The combination of the two roadmaps, which is faster to maintain than
the roadmap maintained by RRT*, efficiently guarantees asymptotic
near-optimality. We suggest to use LBT-RRT for high-quality, anytime motion
planning. We demonstrate the performance of the algorithm for scenarios ranging
from 3 to 12 degrees of freedom and show that even for small approximation
factors, the algorithm produces high-quality solutions (comparable to RRG and
RRT*) with little running-time overhead when compared to RRT
Choreographies in Practice
Choreographic Programming is a development methodology for concurrent
software that guarantees correctness by construction. The key to this paradigm
is to disallow mismatched I/O operations in programs, called choreographies,
and then mechanically synthesise distributed implementations in terms of
standard process models via a mechanism known as EndPoint Projection (EPP).
Despite the promise of choreographic programming, there is still a lack of
practical evaluations that illustrate the applicability of choreographies to
concrete computational problems with standard concurrent solutions. In this
work, we explore the potential of choreographies by using Procedural
Choreographies (PC), a model that we recently proposed, to write distributed
algorithms for sorting (Quicksort), solving linear equations (Gaussian
elimination), and computing Fast Fourier Transform. We discuss the lessons
learned from this experiment, giving possible directions for the usage and
future improvements of choreography languages
- …