On the feasibility of fixed-length block structured architectures

2002 ◽  
Author(s):  
L. Eeckhout ◽  
K. De Bosschere ◽  
H. Neefs
Keyword(s):  
Fixed Length ◽  
Block Structured

Application domains for fixed-length block structured architectures

2002 ◽  
Author(s):  
L. Eeckhout ◽  
T. Vander Aa ◽  
B. Goeman ◽  
H. Vandierendonck ◽  
R. Lauwereins ◽  
...  
Keyword(s):  
Fixed Length ◽  
Block Structured

Early design stage exploration of fixed-length block structured architectures

2000 ◽  
Vol 46 (15) ◽  
pp. 1469-1486 ◽  
Author(s):  
Lieven Eeckhout ◽  
Henk Neefs ◽  
Koen De Bosschere
Keyword(s):  
Design Stage ◽  
Early Design ◽  
Early Design Stage ◽  
Fixed Length ◽  
Block Structured

A Fixed Field/Fixed Length Automated Case Record Using an IBM 1232 Optically Readable Document

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor
Keyword(s):  
Clinical Data ◽  
Case Record ◽  
Fixed Field ◽  
Fixed Length

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.

Algorithmic Logic with Recursive Functions

1981 ◽  
Vol 4 (4) ◽  
pp. 975-995
Author(s):  
Andrzej Szałas
Keyword(s):  
Completeness Theorem ◽  
Inference Rules ◽  
Partial Correctness ◽  
Recursive Functions ◽  
Algorithmic Logic ◽  
Block Structured

A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.

scholarly journals AMReX: Block-structured adaptive mesh refinement for multiphysics applications

2021 ◽  
pp. 109434202110228
Author(s):  
Weiqun Zhang ◽  
Andrew Myers ◽  
Kevin Gott ◽  
Ann Almgren ◽  
John Bell
Keyword(s):  
Adaptive Mesh Refinement ◽  
Mesh Refinement ◽  
Computational Cost ◽  
Adaptive Mesh ◽  
Uniform Mesh ◽  
Physical Processes ◽  
Structured Adaptive Mesh Refinement ◽  
Core Elements ◽  
Accelerator Design ◽  
Block Structured

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

scholarly journals Data Structures to Represent a Set of k -long DNA Sequences

2021 ◽  
Vol 54 (1) ◽  
pp. 1-22
Author(s):  
Rayan Chikhi ◽  
Jan Holub ◽  
Paul Medvedev
Keyword(s):  
Data Structures ◽  
Dna Sequences ◽  
Sequencing Data ◽  
String Algorithms ◽  
Fixed Length ◽  
The Past

The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of k -mers, which are short fixed-length strings present in a dataset. While these approaches are rather diverse, storing and querying a k -mer set has emerged as a shared underlying component. A set of k -mers has unique features and applications that, over the past 10 years, have resulted in many specialized approaches for its representation. In this survey, we give a unified presentation and comparison of the data structures that have been proposed to store and query a k -mer set. We hope this survey will serve as a resource for researchers in the field as well as make the area more accessible to researchers outside the field.

Sign in / Sign up

Export Citation Format

Share Document