2,376 research outputs found
DyMo: Dynamic Monitoring of Large Scale LTE-Multicast Systems
LTE evolved Multimedia Broadcast/Multicast Service (eMBMS) is an attractive
solution for video delivery to very large groups in crowded venues. However,
deployment and management of eMBMS systems is challenging, due to the lack of
realtime feedback from the User Equipment (UEs). Therefore, we present the
Dynamic Monitoring (DyMo) system for low-overhead feedback collection. DyMo
leverages eMBMS for broadcasting Stochastic Group Instructions to all UEs.
These instructions indicate the reporting rates as a function of the observed
Quality of Service (QoS). This simple feedback mechanism collects very limited
QoS reports from the UEs. The reports are used for network optimization,
thereby ensuring high QoS to the UEs. We present the design aspects of DyMo and
evaluate its performance analytically and via extensive simulations.
Specifically, we show that DyMo infers the optimal eMBMS settings with
extremely low overhead, while meeting strict QoS requirements under different
UE mobility patterns and presence of network component failures. For instance,
DyMo can detect the eMBMS Signal-to-Noise Ratio (SNR) experienced by the 0.1%
percentile of the UEs with Root Mean Square Error (RMSE) of 0.05% with only 5
to 10 reports per second regardless of the number of UEs
Formal and Informal Methods for Multi-Core Design Space Exploration
We propose a tool-supported methodology for design-space exploration for
embedded systems. It provides means to define high-level models of applications
and multi-processor architectures and evaluate the performance of different
deployment (mapping, scheduling) strategies while taking uncertainty into
account. We argue that this extension of the scope of formal verification is
important for the viability of the domain.Comment: In Proceedings QAPL 2014, arXiv:1406.156
WevQuery: Testing Hypotheses about Web Interaction Patterns
Remotely stored user interaction logs, which give access to a wealth of data generated by large numbers of users, have been long used to understand if interactive systems meet the expectations of designers. Unfortunately, detailed insight into users' interaction behaviour still requires a high degree of expertise and domain specific knowledge. We present WevQuery, a scalable system to query user interaction logs in order to allow designers to test their hypotheses about users' behaviour. WevQuery supports this purpose using a graphical notation to define the interaction patterns designers are seeking. WevQuery is scalable as the queries can then be executed against large user interaction datasets by employing the MapReduce paradigm. This way WevQuery provides designers effortless access to harvest users' interaction patterns, removing the burden of low-level interaction data analysis. We present two scenarios to showcase the potential of WevQuery, from the design of the queries to their execution on real interaction data accounting for 5.7m events generated by 2,445 unique users
08421 Abstracts Collection -- Uncertainty Management in Information Systems
From October 12 to 17, 2008 the Dagstuhl Seminar 08421 \u27`Uncertainty Management in Information Systems \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. The abstracts of the plenary and session talks given during the seminar as well as those of the shown demos are put together in this paper
Approximate Computing Survey, Part I: Terminology and Software & Hardware Approximation Techniques
The rapid growth of demanding applications in domains applying multimedia
processing and machine learning has marked a new era for edge and cloud
computing. These applications involve massive data and compute-intensive tasks,
and thus, typical computing paradigms in embedded systems and data centers are
stressed to meet the worldwide demand for high performance. Concurrently, the
landscape of the semiconductor field in the last 15 years has constituted power
as a first-class design concern. As a result, the community of computing
systems is forced to find alternative design approaches to facilitate
high-performance and/or power-efficient computing. Among the examined
solutions, Approximate Computing has attracted an ever-increasing interest,
with research works applying approximations across the entire traditional
computing stack, i.e., at software, hardware, and architectural levels. Over
the last decade, there is a plethora of approximation techniques in software
(programs, frameworks, compilers, runtimes, languages), hardware (circuits,
accelerators), and architectures (processors, memories). The current article is
Part I of our comprehensive survey on Approximate Computing, and it reviews its
motivation, terminology and principles, as well it classifies and presents the
technical details of the state-of-the-art software and hardware approximation
techniques.Comment: Under Review at ACM Computing Survey
- …