Efficient implementation of high-order finite elements for Helmholtz problems

Computational modeling remains key to the acoustic design of various applications, but it is constrained by the cost of solving large Helmholtz problems at high frequencies. This paper presents an efficient implementation of the high-order Finite Element Method for tackling large-scale engineering problems arising in acoustics. A key feature of the proposed method is the ability to select automatically the order of interpolation in each element so as to obtain a target accuracy while minimising the cost. This is achieved using a simple local a priori error indicator. For simulations involving several frequencies, the use of hierarchic shape functions leads to an efficient strategy to accelerate the assembly of the finite element model. The intrinsic performance of the high-order FEM for 3D Helmholtz problem is assessed and an error indicator is devised to select the polynomial order in each element. A realistic 3D application is presented in detail to demonstrate the reduction in computational costs and the robustness of the a priori error indicator. For this test case the proposed method accelerates the simulation by an order of magnitude and requires less than a quarter of the memory needed by the standard FEM

Exploiting asynchrony from exact forward recovery for DUE in iterative solvers

This paper presents a method to protect iterative solvers from Detected and Uncorrected Errors (DUE) relying on error detection techniques already available in commodity hardware. Detection operates at the memory page level, which enables the use of simple algorithmic redundancies to correct errors. Such redundancies would be inapplicable under coarse grain error detection, but become very powerful when the hardware is able to precisely detect errors. Relations straightforwardly extracted from the solver allow to recover lost data exactly. This method is free of the overheads of backwards recoveries like checkpointing, and does not compromise mathematical convergence properties of the solver as restarting would do. We apply this recovery to three widely used Krylov subspace methods, CG, GMRES and BiCGStab, and their preconditioned versions. We implement our resilience techniques on CG considering scenarios from small (8 cores) to large (1024 cores) scales, and demonstrate very low overheads compared to state-of-the-art solutions. We deploy our recovery techniques either by overlapping them with algorithmic computations or by forcing them to be in the critical path of the application. A trade-off exists between both approaches depending on the error rate the solver is suffering. Under realistic error rates, overlapping decreases overheads from 5.37% down to 3.59% for a non-preconditioned CG on 8 cores.This work has been partially supported by the European Research Council under the European Union's 7th FP, ERC Advanced Grant 321253, and by the Spanish Ministry of Science and Innovation under grant TIN2012-34557. L. Jaulmes has been partially supported by the Spanish Ministry of Education, Culture and Sports under grant FPU2013/06982. M. Moreto has been partially supported by the Spanish Ministry of Economy and Competitiveness under Juan de la Cierva postdoctoral fellowship JCI-2012-15047. M. Casas has been partially supported by the Secretary for Universities and Research of the Ministry of Economy and Knowledge of the Government of Catalonia and the Co-fund programme of the Marie Curie Actions of the European Union's 7th FP (contract 2013 BP B 00243).Peer ReviewedPostprint (author's final draft

Living with early-stage dementia: a review of qualitative studies

A

A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover. Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints. The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints. For us, constraints are equalities between terms in the language of simple types. Substitutions are formally modeled as finite maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional induction is the main proof technique used in proving many of the axioms.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Analysis of Transaction Management Performance

There is currently much interest in incorporating transactions into both operating systems and general purpose programming languages. This paper provides a detailed examination of the design and performance of the“¢ transaction manager of the Camelot system. Camelot is a transaction facility that provides a rich model of transactions intended to support a wide variety of general-purpose applications. The transaction manager's principal function is to execute the protocols that ensure atomicity. The conclusions of this study are: a simple optimization to two-phase commit reduces logging activity of distributed transactions; non-blocking commit is practical for some applications; multithreaded design improves throughput provided that log batching is used; multi-casting reduces the variance of distributed commit protocols in a LAN environment; and the performance of transaction mechanisms such as Camelot depend heavily upon kernel performance

Microtopographic Inspection of Thermoplastic Rubber Shoe’s Sole: The Influence of Surface Roughness on Sole to Leather Gluing

In Portugal quality shoe’s industry has a major economical importance. The strength and quality of the gluing of the sole to leather are of major importance in the process of making a high quality shoe. This pasting process is standardized for different kinds of sole/leather combinations. However even if proceeding carefully, strictly by the rules, problems due happen and specially as new kinds of sole’s materials and leather’ types are introduced in the production lines. A careful physical characterization of the gluing process as well as all items intervening is again necessary

Automatic generation of hardware/software interfaces

Enabling new applications for mobile devices often requires the use of specialized hardware to reduce power consumption. Because of time-to-market pressure, current design methodologies for embedded applications require an early partitioning of the design, allowing the hardware and software to be developed simultaneously, each adhering to a rigid interface contract. This approach is problematic for two reasons: (1) a detailed hardware-software interface is difficult to specify until one is deep into the design process, and (2) it prevents the later migration of functionality across the interface motivated by efficiency concerns or the addition of features. We address this problem using the Bluespec Codesign Language~(BCL) which permits the designer to specify the hardware-software partition in the source code, allowing the compiler to synthesize efficient software and hardware along with transactors for communication between the partitions. The movement of functionality across the hardware-software boundary is accomplished by simply specifying a new partitioning, and since the compiler automatically generates the desired interface specifications, it eliminates yet another error-prone design task. In this paper we present BCL, an extension of a commercially available hardware design language (Bluespec SystemVerilog), a new software compiling scheme, and preliminary results generated using our compiler for various hardware-software decompositions of an Ogg Vorbis audio decoder, and a ray-tracing application.National Science Foundation (U.S.) (NSF (#CCF-0541164))National Research Foundation of Korea (grant from the Korean Government (MEST) (#R33-10095)

Implementation of Flow Tripping Capability in the USM3D Unstructured Flow Solver

A flow tripping capability is added to an established NASA tetrahedral unstructured parallel Navier-Stokes flow solver, USM3D. The capability is based on prescribing an appropriate profile of turbulence model variables to energize the boundary layer in a plane normal to a specified trip region on the body surface. We demonstrate this approach using the k-e two-equation turbulence model of USM3D. Modification to the solution procedure primarily consists of developing a data structure to identify all unstructured tetrahedral grid cells located in the plane normal to a specified surface trip region and computing a function based on the mean flow solution to specify the modified profile of the turbulence model variables. We leverage this data structure and also show an adjunct approach that is based on enforcing a laminar flow condition on the otherwise fully turbulent flow solution in user specified region. The latter approach is applied for the solutions obtained using other one- and two-equation turbulence models of USM3D. A key ingredient of the present capability is the use of a graphical user-interface tool PREDISC to define a trip region on the body surface in an existing grid. Verification of the present modifications is demonstrated on three cases, namely, a flat plate, the RAE2822 airfoil, and the DLR F6 wing-fuselage configuration

Innovation Management Techniques and Tools: a review from Theory and Practice

Knowledge is considered to be an economic driver in today’s economy. It has become a commodity, a resource that can be packed and transferred. The objective of this paper is to provide a comprehensive review of the scope, trends and major actors (firms, organizations, government, consultants, academia, etc.) in the development and use of methods to manage innovation in a knowledge-driven economy. The paper identifies the main innovation management techniques (IMTs) aiming at the improvement of firm competitiveness by means of knowledge management. It will specifically focus on those IMTs for which knowledge is a relevant part of the innovation process. The research study, based on a survey at the European level, concludes that a knowledge-driven economy affects the innovation process and approach. The traditional idea that innovation is based on research (technology-push theory) and interaction between firms and other actors has been replaced by the current social network theory of innovation, where knowledge plays a crucial role in fostering innovation. Simultaneously, organizations in both public and private sectors have launched initiatives to develop methodologies and tools to support business innovation management. Higher education establishments, business schools and consulting companies are developing innovative and adequate methodologies and tools, while public authorities are designing and setting up education and training schemes aimed at disseminating best practices among all kinds of businesse