4,720 research outputs found
Model-driven Scheduling for Distributed Stream Processing Systems
Distributed Stream Processing frameworks are being commonly used with the
evolution of Internet of Things(IoT). These frameworks are designed to adapt to
the dynamic input message rate by scaling in/out.Apache Storm, originally
developed by Twitter is a widely used stream processing engine while others
includes Flink, Spark streaming. For running the streaming applications
successfully there is need to know the optimal resource requirement, as
over-estimation of resources adds extra cost.So we need some strategy to come
up with the optimal resource requirement for a given streaming application. In
this article, we propose a model-driven approach for scheduling streaming
applications that effectively utilizes a priori knowledge of the applications
to provide predictable scheduling behavior. Specifically, we use application
performance models to offer reliable estimates of the resource allocation
required. Further, this intuition also drives resource mapping, and helps
narrow the estimated and actual dataflow performance and resource utilization.
Together, this model-driven scheduling approach gives a predictable application
performance and resource utilization behavior for executing a given DSPS
application at a target input stream rate on distributed resources.Comment: 54 page
Constrained online resource control using convex programming based allocation
A resource allocation algorithm aimed at embedded multi- media systems is presented. Particular emphasis is placed on computational efficiency, suitability for fixed point im- plementation and being able to solve the allocation at run- time when parameters or dynamics change. The algorithm is derived from classic convex optimization theory and the resulting real time properties are studied in simulations
Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning
This paper considers the problem of resource allocation in stream processing,
where continuous data flows must be processed in real time in a large
distributed system. To maximize system throughput, the resource allocation
strategy that partitions the computation tasks of a stream processing graph
onto computing devices must simultaneously balance workload distribution and
minimize communication. Since this problem of graph partitioning is known to be
NP-complete yet crucial to practical streaming systems, many heuristic-based
algorithms have been developed to find reasonably good solutions. In this
paper, we present a graph-aware encoder-decoder framework to learn a
generalizable resource allocation strategy that can properly distribute
computation tasks of stream processing graphs unobserved from training data.
We, for the first time, propose to leverage graph embedding to learn the
structural information of the stream processing graphs. Jointly trained with
the graph-aware decoder using deep reinforcement learning, our approach can
effectively find optimized solutions for unseen graphs. Our experiments show
that the proposed model outperforms both METIS, a state-of-the-art graph
partitioning algorithm, and an LSTM-based encoder-decoder model, in about 70%
of the test cases.Comment: Accepted by AAAI 202
Implementation issues in source coding
An edge preserving image coding scheme which can be operated in both a lossy and a lossless manner was developed. The technique is an extension of the lossless encoding algorithm developed for the Mars observer spectral data. It can also be viewed as a modification of the DPCM algorithm. A packet video simulator was also developed from an existing modified packet network simulator. The coding scheme for this system is a modification of the mixture block coding (MBC) scheme described in the last report. Coding algorithms for packet video were also investigated
- …