scholarly journals The Reduceron reconfigured and re-evaluated

2012 ◽  
Vol 22 (4-5) ◽  
pp. 574-613 ◽  
Author(s):  
MATTHEW NAYLOR ◽  
COLIN RUNCIMAN
Keyword(s):  
Reconfigurable Hardware ◽  
Functional Language ◽  
Language Implementation ◽  
Time Performance ◽  
Risc Processor ◽  
Dynamic Analyses ◽  
Parallel Memories ◽  
Run Time

AbstractA new version of a special-purpose processor for running lazy functional programs is presented. This processor – the Reduceron – exploits parallel memories and dynamic analyses to increase evaluation speed, and is implemented using reconfigurable hardware. Compared to a more conventional functional language implementation targeting a standard RISC processor running on the same reconfigurable hardware, the Reduceron offers a significant improvement in run-time performance.

scholarly journals CLAIRE: combining sets, search and rules to better express algorithms

2002 ◽  
Vol 2 (6) ◽  
pp. 769-805 ◽  
Author(s):  
YVES CASEAU ◽  
FRANÇOIS-XAVIER JOSSET ◽  
FRANÇOIS LABURTHE
Keyword(s):  
Programming Language ◽  
Functional Language ◽  
Data Types ◽  
Programming Environments ◽  
Abstraction Level ◽  
Time Performance ◽  
Run Time ◽  
C Preprocessor ◽  
Logical Rules ◽  
High Abstraction Level

This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately well known and are available under various programming environments, the originality of the CLAIRE language comes from the tight integration, which yields interesting run-time performances, and from the richness of this combination, which yields new ways in which to express complex algorithmic patterns with few elegant lines. To achieve the opposite goals of a high abstraction level (conciseness and readability) and run-time performance (CLAIRE is used as a C++ preprocessor), we have developed two kinds of compiler: first, a pattern pre-processor handles iterations over both concrete and abstract sets (data types and program fragments), in a completely user-extensible manner; secondly, an inference compiler transforms a set of logical rules into a set of functions (demons that are used through procedural attachment).

Enhance run-time performance with a collaborative distributed speech recognition framework

2015 ◽  
Author(s):  
Nattapong Kurpukdee ◽  
Phuttapong Sertsi ◽  
Sila Chunwijitra ◽  
Vataya Chunwijitra ◽  
Ananlada Chotimongkol ◽  
...  
Keyword(s):  
Speech Recognition ◽  
Distributed Speech Recognition ◽  
Time Performance ◽  
Run Time

Long-run-time performance characteristics of a line-selected 2-kHz F 2 laser for optical microlithography

2001 ◽  
Author(s):  
Georg Soumagne ◽  
Shinji Nagai ◽  
Naoto Hisanaga ◽  
Shinobu Nanzai ◽  
Yoshinori Ochiishi ◽  
...  
Keyword(s):  
Performance Characteristics ◽  
Time Performance ◽  
Long Run ◽  
Run Time
Sign in / Sign up

Export Citation Format

Share Document