Exploitation of Parallelism for Applications with an Input Data Stream: Optimal Resource-Throughput Tradeoffs

Author(s):  
F. Guirado ◽  
A. Ripoll ◽  
C. Roig ◽  
E. Luque
2015 ◽  
Vol 10 (2) ◽  
pp. 91-98
Author(s):  
Mikhail Gorodilov ◽  
Boris Dolgovesov ◽  
Ivan Khramtsov ◽  
Aleksandr Radostev

This article is devoted to solving some of the issues of distributed multimedia data display on large screens. In particular, we consider the problem of synchronization of the process of parallel rendering and output of video fragments to the appropriate modules of multiscreen display systems. Proposed synchronization algorithm and its implementation using graphics accelerators, provides visual continuity of dynamic scenes when displayed on a multiscreen. The problems of managing distributed input data stream for multiscreen display are considered.


Author(s):  
Jana Polgar ◽  
Robert Mark Braum ◽  
Tony Polgar

Most of today’s portal implementations provide a model that facilitates plugging various components (portlets) into the portal infrastructure. Portlets run locally on the portal server, process input data, and render output. A local portlet and a good caching strategy for the content improves the response times, performance, and scalability of portal systems. However, very often we need to access remote Web services. One solution is to use a local portlet to access a remote Web service via its interface, obtain the required results as a raw data stream, and locally render the results in a fragment. This approach is relevant for data-oriented Web services. An alternative solution is to equip the Web service with an additional interface in the form of a portlet. When the Web service is called, it returns the entire portlet instead of raw data. This approach is suitable for presentation-oriented Web services.


2020 ◽  
Vol 10 (2) ◽  
pp. 606 ◽  
Author(s):  
Osama A. Mahdi ◽  
Eric Pardede ◽  
Nawfal Ali ◽  
Jinli Cao

A data stream can be considered as a sequence of examples that arrive continuously and are potentially unbounded, such as web page visits, sensor readings and call records. One of the serious and challenging problems that appears in a data stream is concept drift. This problem occurs when the relation between the input data and the target variable changes over time. Most existing works make an optimistic assumption that all incoming data are labelled and the class labels are available immediately. However, such an assumption is not always valid. Therefore, a lack of class labels aggravates the problem of concept drift detection. With this motivation, we propose a drift detector that reacts naturally to sudden drifts in the absence of class labels. In a novel way, the proposed detector reacts to concept drift in the absence of class labels, where the true label of an example is not necessary. Instead of monitoring the error estimates, the proposed detector monitors the diversity of a pair of classifiers, where the true label of an example is not necessary to determine whether components disagree. Using several datasets, an experimental evaluation and comparison is conducted against several existing detectors. The experiment results show that the proposed detector can detect drifts with less delay, runtime and memory usage.


Author(s):  
A.V. Skatkov ◽  
◽  
LA. Balakireva ◽  

This paper proposes an approach for solving management model environment objects parametric adaptation based on the queuing systems domination procedures with random input data stream problem. A constructing majorizing system algorithm based on the majorization problem solution is proposed. The system provides environment monitoring system structure with its performance, input data stream intensity and processing labor-intensive balancing. The detailed experiment findings are discussed.


Electronics ◽  
2019 ◽  
Vol 8 (10) ◽  
pp. 1119 ◽  
Author(s):  
Yin ◽  
Fu ◽  
El-Sankary

A process-voltage-temperature (PVT)-robust, low power, low noise, and high sensitivity, super-regenerative (SR) receiver is proposed in this paper. To enable high sensitivity and robust-PVT operation, a fast locking phase-locked-loop (PLL) with initial random phase error reduction is proposed to continuously adjust the center frequency deviations of the SR oscillator (SRO) without interrupting the input data stream. Additionally, a concurrent quenching waveform (CQW) technique is devised to improve the SRO sensitivity and its noise performance. The proposed SRO architecture is controlled by two separate biasing branches to extend the sensitivity accumulation (SA) phase and reduce its noise during the SR phase, compared to the conventional optimal quenching waveform (OQW). The proposed SR receiver is implemented at 2.46 GHz center frequency in 180 nm SMIC CMOS technology and achieves better sensitivity, power consumption, noise performance, and PVT immunity compared with existent SR receiver architectures.


Author(s):  
E. L. Cranford ◽  
M. A. Gray

The integrity of fatigue monitoring results is influenced by the input data stream, and the accurate accounting of continuity between time periods used for data capture and analysis. This paper discusses the treatment of continuity with respect to applied methods of evaluation used in fatigue monitoring. The items discussed here are applicable to various aspects of fatigue monitoring assessment, including the evaluation of reactor water environmental effects. Proper treatment of continuity in the evaluation processes is essential to the accuracy of any monitoring assessment.


Author(s):  
Przemysław Andrzej Wałęga ◽  
Mark Kaminski ◽  
Bernardo Cuenca Grau

We study stream reasoning in datalogMTL—an extension of Datalog with metric temporal operators. We propose a sound and complete stream reasoning algorithm that is applicable to a fragment datalogMTLFP of datalogMTL, in which propagation of derived information towards past time points is precluded. Memory consumption in our algorithm depends both on the properties of the rule set and the input data stream; in particular, it depends on the distances between timestamps occurring in data. This is undesirable since these distances can be very small, in which case the algorithm may require large amounts of memory. To address this issue, we propose a second algorithm, where the size of the required memory becomes independent on the timestamps in the data at the expense of disallowing punctual intervals in the rule set. Finally, we provide tight bounds to the data complexity of standard query answering in datalogMTLFP without punctual intervals in rules, which yield a new PSPACE lower bound to the data complexity of the full datalogMTL.


Sign in / Sign up

Export Citation Format

Share Document