
<rss version="0.91">
    <channel>
        <title>Latest Articles from JUCS - Journal of Universal Computer Science</title>
        <description>Latest 7 Articles from JUCS - Journal of Universal Computer Science</description>
        <link>https://lib.jucs.org/</link>
        <lastBuildDate>Sun, 16 Aug 2026 01:40:06 +0000</lastBuildDate>
        <generator>Pensoft FeedCreator</generator>
        <image>
            <url>https://lib.jucs.org/i/logo.jpg</url>
            <title>Latest Articles from JUCS - Journal of Universal Computer Science</title>
            <link>https://lib.jucs.org/</link>
            <description><![CDATA[Feed provided by https://lib.jucs.org/. Click to visit.]]></description>
        </image>
	
		<item>
		    <title>Temporal Accelerators: Unleashing the Potential of Embedded FPGAs</title>
		    <link>https://lib.jucs.org/article/77247/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 27(11): 1174-1192</p>
					<p>DOI: 10.3897/jucs.77247</p>
					<p>Authors: Christopher Cichiwskyj, Gregor Schiele</p>
					<p>Abstract: When the complexity of a problem rises, its solution requires more hardware resources. A usual way to solve this is to use larger processors and add more memory. When using Field Programmable Gate-Arrays (FPGAs), which can instantiate arbitrary circuit designs, a larger, more costly and power hungry chip is used. In this paper we propose a different approach, namely to split the problem into a graph of interdependent smaller tasks and to reconfigure a small FPGA during runtime to execute each of these tasks efficiently sequentially. This can result in cheaper and more energy efficient systems that can execute very complex problems locally. We present a basic analytical model, evaluate its accuracy and discuss initial insight from it.</p>
					<p><a href="https://lib.jucs.org/article/77247/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/77247/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/77247/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Sun, 28 Nov 2021 10:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>A Fine-Grained Hardware Security Approach for Runtime Code Integrity in Embedded Systems</title>
		    <link>https://lib.jucs.org/article/23154/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 24(4): 515-536</p>
					<p>DOI: 10.3217/jucs-024-04-0515</p>
					<p>Authors: Xiang Wang, Weike Wang, Bin Xu, Pei Du, Lin Li, Muyang Liu</p>
					<p>Abstract: Embedded systems are subjected to various adversaries including software attacks, physical attacks, and side channel attacks. Most of these malicious attacks can lead to the invalid execution of programs, and launch of destructive actions or reveal critical information. However, most previous security mechanisms suffer from coarse checking granularity and unacceptable performance overhead, due to strict restriction on system resources. This paper presents a fine-grained hardware-based security approach to ensure runtime code integrity in the embedded systems by offline profiling of the program features and runtime integrity check. We design a hardware implemented instruction stream integrity checker (ISIC) to perform runtime checking of pre-extracted features. Any invalid execution of the program will trigger the corresponding exception signal. We implement the ISIC with OR1200 processor on XC5VLX50T field-programmable gate array (FPGA). The experimental results show that the proposed approach can detect all the attacks destructing integrity of the instruction stream, and the performance overhead induced by the security mechanism is less than 3.45% according to the selected benchmarks.</p>
					<p><a href="https://lib.jucs.org/article/23154/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/23154/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/23154/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Sat, 28 Apr 2018 00:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>Design of Arbiters and Allocators Based on Multi-Terminal BDDs</title>
		    <link>https://lib.jucs.org/article/29734/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 16(14): 1826-1852</p>
					<p>DOI: 10.3217/jucs-016-14-1826</p>
					<p>Authors: Václav Dvořák, Petr Mikušek</p>
					<p>Abstract: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways, from hardware to firmware to software. The paper presents a new computer-aided technique that can produce representations of arbiters/allocators in a form of a Multi-Terminal Binary Decision Diagram (MTBDD) with close to minimum cost and width. This diagram can then serve as a prototype for a cascade of multiple-output look-up tables (LUTs) that implements the given function, or for efficient firmware implementation. The technique makes use of iterative decomposition of integer functions of Boolean variables and a variable-ordering heuristic to order variables. The LUT cascades lead directly to the pipelined design, simplify wiring and testing and can compete with the traditional FPGA design in performance and with PLA design in chip area.</p>
					<p><a href="https://lib.jucs.org/article/29734/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/29734/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/29734/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Wed, 28 Jul 2010 00:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>The Architecture and Circuital Implementation Scheme of a New Cell Neural Network for Analog Signal Processing</title>
		    <link>https://lib.jucs.org/article/28857/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 13(9): 1344-1353</p>
					<p>DOI: 10.3217/jucs-013-09-1344</p>
					<p>Authors: Youren Wang, Zhiqiang Zhang, Jiang Cui</p>
					<p>Abstract: It is a difficult problem that using cellular neural network to make up of analog signal processing circuit. This paper presented the architecture of new cellular neural network SCCNN for analog signal processing circuits, designed the neural cell circuit, and developed the evolutionary design method of the SCCNN based on selfadapting genetic algorithm. In the architecture of new cellular neural network SCCNN, each neural cell connects with four neighborhood neural cells, the neural cell circuit and signal transfer line between neural cells are controlled by programmable switches. The validity of the SCCNN architecture and the evolutionary design method are verified through digital simulation. The experimental results indicate that the SCCNN hardware is a universal cellular neural network for analog signal processing circuit, which can be used to make up of the analog signal amplifier, analog signal filter, digit logic circuit, DAC circuit and so on.</p>
					<p><a href="https://lib.jucs.org/article/28857/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/28857/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/28857/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Fri, 28 Sep 2007 00:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>Performance Evaluation and Limitations of a Vision System on a Reconfigurable/Programmable Chip</title>
		    <link>https://lib.jucs.org/article/28759/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 13(3): 440-453</p>
					<p>DOI: 10.3217/jucs-013-03-0440</p>
					<p>Authors: José Fernández-Pérez, Francisco Sánchez-Fernández, Ricardo Carmona-Galán</p>
					<p>Abstract: This paper presents a survey of the characteristics of a vision system implemented in a reconfigurable/programmable chip (FPGA). System limitations and performance have been evaluated in order to derive specifications and constraints for further vision system synthesis. The system hereby reported has a conventional architecture. It consists in a central microprocessor (CPU) and the necessary peripheral elements for data acquisition, data storage and communications. It has been designed to stand alone, but a link to the programming and debugging tools running in a digital host (PC) is provided. In order to alleviate the computational load of the central microprocessor, we have designed a visual co-processor in charge of the low-level image processing tasks. It operates autonomously, commanded by the CPU, as another system peripheral. The complete system, without the sensor, has been implemented in a single reconfigurable chip as a SOPC. The incorporation of a dedicated visual co-processor, with specific circuitry for low-level image processing acceleration, enhances the system throughput outperforming conventional processing schemes. However, time-multiplexing of the dedicated hardware remains a limiting factor for the achievable peak computing power. We have quantified this effect and sketched possible solutions, like replication of the specific image processing hardware.</p>
					<p><a href="https://lib.jucs.org/article/28759/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/28759/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/28759/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Wed, 28 Mar 2007 00:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>On Pipelining Sequences of Data-Dependent Loops</title>
		    <link>https://lib.jucs.org/article/28758/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 13(3): 419-439</p>
					<p>DOI: 10.3217/jucs-013-03-0419</p>
					<p>Authors: Rui M. M. Rodrigues, João M. P. Cardoso</p>
					<p>Abstract: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually perform computations (with loop intensive behavior) and produce new data to be consumed by subsequent tasks. This paper shows a scheme to pipeline sequences of data-dependent loops, in such a way that subsequent loops can start execution before the completion of the previous ones, which achieves performance improvements. It uses a hardware scheme with decoupled and concurrent data-path and control units that start execution at the same time. The communication of array elements between two loops in sequence is performed by special buffers with a data-driven, fine-grained scheme. Buffer elements are responsible to flag the availability of each array element requested by a subsequent loop (i.e., a ready protocol is used to trigger the execution of operations in the succeeding loop). Thus, the control execution of following loops is also orchestrated by data availability (in this case at the array element grain) and out-of-order produced-consumed pairs are permitted. The concept has been applied using Nau, a compiler infrastructure to map algorithms described in Java onto FPGAs. This paper presents very encouraging results showing important performance improvements and buffer size reductions for a number of benchmarks.</p>
					<p><a href="https://lib.jucs.org/article/28758/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/28758/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/28758/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Wed, 28 Mar 2007 00:00:00 +0000</pubDate>
		</item>
	
		<item>
		    <title>Object-Oriented Embedded System Development Based on Synthesis and Reuse of OO-ASIPs</title>
		    <link>https://lib.jucs.org/article/28290/</link>
		    <description><![CDATA[
					<p>JUCS - Journal of Universal Computer Science 10(9): 1123-1155</p>
					<p>DOI: 10.3217/jucs-010-09-1123</p>
					<p>Authors: Maziar Goudarzi, Shaahin Hessabi, Alan Mycroft</p>
					<p>Abstract: We present an embedded_system design flow, discuss its details, and demonstrate its advantages. We adopt the object_oriented methodology for the system_level model because software dominates hardware in embedded systems and the object_oriented methodology is already established for software design and reuse. As the building_block of system implementation, we synthesise application_specific processors that are reusable, through programming, for several related applications. This addresses the high cost and risk of manufacturing specialised hardware tailored to only a single application. Both the processor and its software are generated from the model of the system by the synthesis and compilation procedures provided. We observe that the key point in object_oriented methodology is the class library, and hence, we implement methods of the class library as the instruction_set of the processor. This allows the processor to be synthesised just once, but, by programming, to be reused several times and specialised to new applications that use the same class library. An important point here is that the processor allows its instructions to be selectively overridden by software routines, this not only allows augmentation of processor capabilities in software, but also enables a structured approach to make software patches to faulty or outdated hardware. A case study illustrates application of the methodology to various applications modelled on top of a common basis class library, and moreover, demonstrates new application_specific opportunities in power management (and area_management for FPGA implementations) resulting from the structure of the processor based on de_activation of unused features.</p>
					<p><a href="https://lib.jucs.org/article/28290/">HTML</a></p>
					<p><a href="https://lib.jucs.org/article/28290/download/xml/">XML</a></p>
					<p><a href="https://lib.jucs.org/article/28290/download/pdf/">PDF</a></p>
			]]></description>
		    <category>Research Article</category>
		    <pubDate>Tue, 28 Sep 2004 00:00:00 +0000</pubDate>
		</item>
	
	</channel>
</rss>
	