Browsing by Subject "Real time systems"

Now showing 1 - 19 of 19

Open Access
Access pattern-based code compression for memory-constrained systems
(Association for Computing Machinery, 2008-09) Ozturk, O.; Kandemir, M.; Chen, G.
As compared to a large spectrum of performance optimizations, relatively less effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of addressing this constraint is to compress executable code and data as much as possible. While researchers on code compression have studied efficient hardware and software based code compression strategies, many of these techniques do not take application behavior into account; that is, the same compression/decompression strategy is used irrespective of the application being optimized. This article presents an application-sensitive code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks of the application are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose and evaluate several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts. Some of our strategies make use of profile data, whereas others are fully automatic. Our experimental evaluation using seven applications from the MediaBench suite and three large embedded applications reveals that the proposed code compression strategy is very successful in practice. Our results also indicate that working at a basic block granularity, as opposed to a procedure granularity, is important for maximizing memory space savings. © 2008 ACM.
Open Access
ALACA: a platform for dynamic alarm collection and alert notification in network management systems
(John Wiley and Sons Ltd., 2017) Solmaz, S. E.; Gedik, B.; Ferhatosmanoğlu, H.; Sözüer, S.; Zeydan, E.; Etemoğlu, Ç. Ö.
Mobile network operators run Operations Support Systems that produce vast amounts of alarm events. These events can have different significance levels and domains and also can trigger other ones. Network operators face the challenge to identify the significance and root causes of these system problems in real time and to keep the number of remedial actions at an optimal level, so that customer satisfaction rates can be guaranteed at a reasonable cost. In this paper, we propose a scalable streaming alarm management system, referred to as Alarm Collector and Analyzer, that includes complex event processing and root cause analysis. We describe a rule mining and root cause analysis solution for alarm event correlation and analyses. The solution includes a dynamic index for matching active alarms, an algorithm for generating candidate alarm rules, a sliding window–based approach to save system resources, and a graph-based solution to identify root causes. Alarm Collector and Analyzer is used in the network operation center of a major mobile telecom provider. It helps operators to enhance the design of their alarm management systems by allowing continuous analysis of data and event streams and predict network behavior with respect to potential failures by using the results of root cause analysis. We present experimental results that provide insights on performance of real-time alarm data analytics systems. Copyright © 2017 John Wiley & Sons, Ltd.
Open Access
Analysis of concurrency control protocols for real-time database systems
(Elsevier, 1998) Ulusoy, Özgür
This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for real-time database systems (RTDBSs). Transactions processed in a RTDBS are associated with timing constraints typically in the form of deadlines. The primary consideration in developing a RTDBS concurrency control protocol is the fact that satisfaction of the timing constraints of transactions is as important as maintaining the consistency of the underlying database. The proposed solution method provides the evaluation of the performance of concurrency control protocols in terms of the satisfaction rate of timing constraints. As a case study, a RTDBS concurrency control protocol, called High Priority, is analyzed using the proposed method. The accuracy of the performance results obtained is ascertained via simulation. The solution method is also used to investigate the real-time performance benefits of the High Priority over the ordinary Two-Phase Locking.
Open Access
Data replication versus timing constraints in distributed database systems
(ACM, 1994-03) Ulusoy, Özgür
In a database system supporting a real-time application, each transaction is associated with a timing constraint, typically in the form of a deadline. Replicated database systems possess desirable features for real-time applications, such as a high level of data availability, and potentially improved response time for queries. On the other hand, multiple copy updates lead to a considerable overhead due to the communication required among the data sites holding the copies. In this paper, we investigate the impact of storing multiple copies of data on satisfying the timing constraints of real-time transactions. A detailed performance model of a distributed database system is employed in evaluating the effects of various workload parameters and design alternatives on the system performance. The performance is expressed in terms of the fraction of satisfied transaction deadlines.
Open Access
Discriminative fine-grained mixing for adaptive compression of data streams
(Institute of Electrical and Electronics Engineers, 2014) Gedik, B.
This paper introduces an adaptive compression algorithm for transfer of data streams across operators in stream processing systems. The algorithm is adaptive in the sense that it can adjust the amount of compression applied based on the bandwidth, CPU, and workload availability. It is discriminative in the sense that it can judiciously apply partial compression by selecting a subset of attributes that can provide good reduction in the used bandwidth at a low cost. The algorithm relies on the significant differences that exist among stream attributes with respect to their relative sizes, compression ratios, compression costs, and their amenability to application of custom compressors. As part of this study, we present a modeling of uniform and discriminative mixing, and provide various greedy algorithms and associated metrics to locate an effective setting when model parameters are available at run-time. Furthermore, we provide online and adaptive algorithms for real-world systems in which system parameters that can be measured at run-time are limited. We present a detailed experimental study that illustrates the superiority of discriminative mixing over uniform mixing. © 2013 IEEE.
Open Access
Dynamic texture detection, segmentation and analysis
(ACM, 2007-07) Töreyin, Behçet Uğur; Dedeoğlu, Yiğithan; Çetin, A. Enis; Fazekas, S.; Chetverikov, D.; Amiaz, T.; Kiryati, N.
Dynamic textures are common in natural scenes. Examples of dynamic textures in video include fire, smoke, clouds, trees in the wind, sky, sea and ocean waves etc. In this showcase, (i) we develop real-time dynamic texture detection methods in video and (ii) present solutions to video object classification based on motion information. Copyright 2007 ACM.
Open Access
Generating time-varying road network data using sparse trajectories
(IEEE, 2016-12) Eser, Elif; Kocayusufoğlu, F.; Eravci, Bahaedd; Ferhatosmanoglu, Hakan; Larriba-Pey, J. L.
While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from vehicles, we develop a time-varying road network data set where edge weights differ over time. We present our methodology and share this dataset, along with a graph manipulation tool. We estimate the traffic conditions using the sparse GPS data available by characterizing the sparsity issues and assessing the properties of travel sequence data frequency domain. We develop interpolation methods to complete the sparse data into a complete graph dataset with realistic time-varying edge values. We evaluate the performance of time-varying and static shortest path solutions over the generated dynamic road network. The shortest paths using the dynamic graph produce very different results than the static version. We provide an independent Java API and a graph database to analyze and manipulate the generated time-varying graph data easily, not requiring any knowledge about the inners of the graph database system. We expect our solution to support researchers to pursue problems of time-varying graphs in terms of theoretical, algorithmic, and systems aspects. The data and Java API are available at: http://elif.eser.bilkent.edu.tr/roadnetwork. © 2016 IEEE.
Open Access
Mars: A tool-based modeling, animation, and parallel rendering system
(Springer, 1994) Aktıhanoğlu, M.; Özgüç, B.; Aykanat, Cevdet
This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the articulated object in its stick, control vertex, or rectangular prism representation and previews the motion in real time. Then the data representing the motion and the models is sent to a multicomputer [iPSC/2 Hypercube (Intel)]. The frames are rendered in parallel, exploiting the coherence between successive frames, thus cutting down the rendering time significantly. Our main aim is to make a detailed study on rendering of a sequence of 3D scenes. The results show that due to an inherent correlation between the 3D scenes, an efficient rendering can be achieved. © 1994 Springer-Verlag.
Open Access
Modeling and feedback control for subsonic cavity flows: a collaborative approach
(IEEE, 2005) Yan, P.; Debiasi, M.; Yuan, X.; Caraballo, E.; Serrani, A.; Özbay, Hitay; Myatt, J. M.; Samimy, M.
Feedback control of aerodynamic flows is attracting the attention of researchers from a wide spectrum of specialties, because of its interdisciplinary nature and the challenges inherent to the problem. One of the main goals of the Collaborative Center of Control Science at The Ohio State University is to bring together researchers from different disciplines to advance the science and technology of flow control. This paper presents a comprehensive summary of the effort of the Center on modeling and feedback control of subsonic cavity-flow resonance. In particular, we give a detailed description of the experimental apparatus, including the wind tunnel testbed, the data measurement and acquisition system, and the real time control system. Reduced-order models of the flow dynamics based on physically-oriented linear models and Proper Orthogonal Decomposition are introduced and their effectiveness for control system design discussed. Finally, results obtained with experimental and model-based controller design are discussed.
Open Access
Network access protocol for hard real-time communication systems
(Elsevier, 1995) Ulusoy, Özgür
Distributed hard real-time systems are characterized by communication messages associated with timing constraints, typically in the form of deadlines. A message should be received at the destination before its deadline expires. Carrier sense multiple access with collision detection (CSMA/CD) appears to be one of the most common communication network access schemes that can be used in distributed hard real-time systems. In this paper, we propose a new real-time network access protocol which is based on the CSMA/CD scheme. The protocol classifies the messages into two classes as 'critical' and 'noncritical' messages. The messages close to their deadlines are considered to be critical. A critical message is given the right to access the network by preempting a noncritical message in transmission. Extensive simulation experiments have been conducted to evaluate the performance of the protocol. It is shown that the protocol can provide considerable improvement over the virtual time CSMA/CD protocol proposed for hard real-time communication by Zhao et al.1. © 1995.
Open Access
OLSR-aware distributed channel access scheduling for wireless mesh networks
(IEEE, 2009-04) Kas, Miray; Körpeoğlu, İbrahim; Karasan, Ezhan
In this paper, we present OA-TDMA (OLSR-Aware TDMA), a TDMA based cross-layer channel access scheduling scheme which uses the information collected by the OLSR routing protocol. In OA-TDMA, each node makes decisions in a distributed manner with no central control, using the local information disseminated by the OLSR protocol. The distinctive feature of the OA-TDMA protocol lies in its weighting scheme where OA-TDMA approximates the traffic passing through each node by using the local topology information collected by OLSR. Our simulations on ns-2 confirm the significant performance improvement achieved by the combination of OLSR and OATDMA over other scheduling schemes considered in this paper. ©2009 IEEE.
Open Access
One-dimensional partitioning for heterogeneous systems: theory and practice
(Academic Press, 2008-11) Pınar, A.; Tabak, E. K.; Aykanat, Cevdet
We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. © 2008 Elsevier Inc. All rights reserved.
Open Access
Procedural visualization of knitwear and woven cloth
(Pergamon Press, 2007-11) Durupınar, F.; Güdükbay, Uğur
In this paper, a procedural method for the visualization of knitted and woven fabrics is presented. The proposed method is compatible with a mass-spring model and makes use of the regular warp-weft structure of the cloth. The visualization parameters for the loops and threads are easily mapped to the animated mass-spring model. The simulation idea underlying both knitted and woven fabrics is similar as we represent both structures in 3D. As the proposed method is simple and practical, we can achieve near real-time rendering performance with good visual quality. © 2007 Elsevier Ltd. All rights reserved.
Open Access
Processing real-time transactions in a replicated database system
(Springer/Kluwer Academic Publishers, 1994) Ulusoy, Özgür
A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. It is difficult to satisfy all timing constraints due to the consistency requirements of the underlying database. In scheduling the transactions it is aimed to process as many transactions as possible within their deadlines. Replicated database systems possess desirable features for real-time applications, such as a high level of data availability, and potentially improved response time for queries. On the other hand, multiple copy updates lead to a considerable overhead due to the communication required among the data sites holding the copies. In this paper, we investigate the impact of storing multiple copies of data on satisfying the timing constraints of real-time transactions. A detailed performance model of a distributed database system is employed in evaluating the effects of various workload parameters and design alternatives on the system performance. The performance is expressed in terms of the fraction of satisfied transaction deadlines. A comparison of several real-time concurrency control protocols, which are based on different approaches in involving timing constraints of transactions in scheduling, is also provided in performance experiments. © 1994 Kluwer Academic Publishers.
Open Access
Real-time fire and flame detection in video
(IEEE, 2005) Dedeoğlu, Yigithan; Töreyin, B. Ugur; Güdükbay, Uğur; Çetin, A. Enis
This paper proposes a novel method to detect fire and/or flame by processing the video data generated by an ordinary camera monitoring a scene. In addition to ordinary motion and color clues, flame and fire flicker is detected by analyzing the video in wavelet domain. Periodic behavior in flame boundaries is detected by performing temporal wavelet transform. Color variations in fire is detected by computing the spatial wavelet transform of moving fire-colored regions. Other clues used in the fire detection algorithm include irregularity of the boundary of the fire colored region and the growth of such regions in time. All of the above clues are combined to reach a final decision.
Open Access
Real-time imaging of vortex-antivortex annihilation in Bi 2Sr2CaCu2O8+δ single crystals by low temperature scanning hall probe microscopy
(IOP Institute of Physics Publishing, 2006) Dede, M.; Oral, A.; Yamamoto, T.; Kadowaki, K.; Shtrikman, H.
Vortices in superconductors play an important role in operating limits and applications of the superconductors. Scanning Hall probe microscopes have proven themselves to be quantitative and non-invasive tools for investigating magnetic samples down to 50 nm scale. Penetration of vortices in high quality single crystal Bi2Sr2CaCu2O8+δ superconductor has been studied in real-time with single vortex resolution at 77 K using a low temperature scanning Hall probe microscope (LT-SHPM). Vortices have been observed to be annihilated by the antivortices in small M-H loops.
Open Access
Real-time smoke and flame detection in video
(IEEE, 2005) Töreyin, B. Uğur; Dedeoğlu, Yiğithan; Çetin, A. Enis
A novel method to detect smoke and/or flame by processing the video data generated by an ordinary camera monitoring a scene is proposed. It is assumed the camera is stationary. Since the smoke is semi-transparent, edges of image frames start loosing their sharpness and this leads to a decrease in the high frequency content of the image. To determine the smoke, the background of the scene is estimated and decrease of high frequency energy of the scene is monitored using the spatial wavelet transforms of the current and the background images. For the detection of flames, in addition to ordinary motion and color clues, flicker analysis is also carried out by analyzing the video in wavelet domain. These clues are combined to reach a final decision.
Open Access
Snippet based trajectory statistics histograms for assistive technologies
(Springer, 2014-09) İscen, Ahmet; Wang Y.; Duygulu, Pınar; Hauptmann, A.
Due to increasing hospital costs and traveling time, more and more patients decide to use medical devices at home without traveling to the hospital. However, these devices are not always very straight-forward for usage, and the recent reports show that there are many injuries and even deaths caused by the wrong use of these devices. Since human supervision during every usage is impractical, there is a need for computer vision systems that would recognize actions and detect if the patient has done something wrong. In this paper, we propose to use Snippet Based Trajectory Statistics Histograms descriptor to recognize actions in two medical device usage problems; inhaler device usage and infusion pump usage. Snippet Based Trajectory Statistics Histograms encodes the motion and position statistics of densely extracted trajectories from a video. Our experiments show that by using Snippet Based Trajectory Statistics Histograms technique, we improve the overall performance for both tasks. Additionally, this method does not require heavy computation, and is suitable for real-time systems. © Springer International Publishing Switzerland 2015.
Open Access
A survey on scheduling in IEEE 802.16 mesh mode
(Institute of Electrical and Electronics Engineers, 2010) Kas, M.; Yargicoglu, B.; Korpeoglu, I.; Karasan, E.
IEEE 802.16 standard (also known as WiMAX) defines the wireless broadband network technology which aims to solve the so called last mile problem via providing high bandwidth Internet even to the rural areas for which the cable deployment is very costly. The standard mainly focuses on the MAC and PHY layer issues, supporting two transmission modes: PMP (Point-to-Multipoint) and mesh modes. Mesh mode is an optional mode developed as an extension to PMP mode and it has the advantage of having an improving performance as more subscribers are added to the system using multi-hop routes. In 802.16 MAC protocol, mesh mode slot allocation and reservation mechanisms are left open which makes this topic a hot research area. Hence, the focus of this survey will mostly be on the mesh mode, and the proposed scheduling algorithms and performance evaluation methods. © 2010 IEEE.