Blockchain is an emerging technology for decentralized transactional data sharing networks of untrusted participants. Monitoring and alerting are crucial functionalities when it comes to blockchain projects running in...
详细信息
Blockchain is an emerging technology for decentralized transactional data sharing networks of untrusted participants. Monitoring and alerting are crucial functionalities when it comes to blockchain projects running in production. In the meantime, different blockchain monitoring systems lack detailed and real-time metrics. In addition to that, the adoption of different DLTs (Distributed Ledger Technologies) is poor. To solve this problem, we propose a realtime-based information framework to monitor blockchain applications. Our monitoring framework is not only a log-based method but also gathers other system metrics (e.g., CPU throughput, latency). the main benefits of our approach are lower configuration setup, more detailed metrics, and, larger DLTs adoption than the existing monitoring tools. We implement the framework to monitor three well-known blockchain systems. the experimental results show that our framework can make a detailed and realtime monitoring of blockchain projects.
Energy-harvesting devices have enabled Internet of things applicationsthat were impossible before. One core challenge of batteryless sensors that operate intermittently is reliable timekeeping. State-of-the-art low-p...
详细信息
ISBN:
(纸本)9781450371025
Energy-harvesting devices have enabled Internet of things applicationsthat were impossible before. One core challenge of batteryless sensors that operate intermittently is reliable timekeeping. State-of-the-art low-power real-time clocks suffer from long start-up times (order of seconds) and have low timekeeping granularity (tens of milliseconds at best), often not matching timing requirements of devices that experience numerous power outages per second. Our key insight is that time can be inferred by measuring alternative physical phenomena, like the discharge of a simple RC circuit, and that timekeeping energy cost and accuracy can be modulated depending on the run-time requirements. We achieve these goals with a multi-tier timekeeping architecture, named Cascaded Hierarchical Remanence timekeeper (CHRT), featuring an array of different RC circuits to be used for dynamic timekeeping requirements. the CHRT and its accompanying software interface are embedded into a fresh batteryless wireless sensing platform, called Botoks, capable of tracking time across power failures. Low start-up time (max 5 ms), high resolution (up to 1 ms) and run-time reconfigurability are the key features of our timekeeping platform. We developed two time-sensitive batteryless applications to demonstrate the approach: a bicycle analytics tool-where the CHRT is used to track time between revolutions of a bicycle wheel, and wireless communication-where the CHRT enables radio synchronization between two intermittently-powered sensors.
Withthe increasing use of multi-core platforms in safety-related domains, aircraft system integrators and authorities exhibit a concern about the impact of concurrent access to shared-resources in the Worst-Case Exec...
详细信息
In current digital age, the Internet of things (IoT) plays a critical role in real-time data perception and computation in order to better manage the system in an automated manner. In this work, we will present the ed...
详细信息
ISBN:
(纸本)9781665416658
In current digital age, the Internet of things (IoT) plays a critical role in real-time data perception and computation in order to better manage the system in an automated manner. In this work, we will present the edge computing concept of IoT architecture, which increases the efficiency of complicated application processing and is known as fog computing. the rapid expansion of computing resources may be regarded to improve real-time data capabilities such as detection, capture, collecting, and processing across billions of linked devices and support a range of applications such as smart wearable devices, smart meters, and smart homes. the advancement of big data technologies makes it simpler to process and analyze massive volumes of IoT data. Smart devices continue to confront a number of problems in terms of computational power, memory storage, batteries, and frequency bandwidth, all of which degrade their Quality of Service (QoS) and user activities. Fog-embedded cloud computing is viewed as a computer paradigm that alleviates the fixed resource load for smart equipment by allowing end-users to develop programs with flexible resources at the lowest possible cost in terms of architecture, software, and platforms.
Interesting approaches to counteract performance variability within cloud datacenters include sending multiple request clones, either immediately or after a specified waiting time. In this paper we present a performan...
详细信息
ISBN:
(纸本)9781450371094
Interesting approaches to counteract performance variability within cloud datacenters include sending multiple request clones, either immediately or after a specified waiting time. In this paper we present a performance model of cloud applicationsthat utilize the latter concept, known as speculative execution. We study the popular Join-Shortest-Queue load-balancing strategy under the processor sharing queuing discipline. Utilizing the near-synchronized service property of this setting, we model speculative execution using a simplified synchronized service model. Our model is approximate, but accurate enough to be useful even for high utilization scenarios. Furthermore, the model is valid for any, possibly empirical, inter-arrival and service time distributions. We present preliminary simulation results, showing the promise of our proposed model.
Together with Fixed Priority Scheduling, Earliest Deadline First (EDF) is the second leg on top of which a large portion of the research on real-timesystems stands. At the heart of the EDF exact schedulability test, ...
详细信息
ISBN:
(纸本)9781728131979
Together with Fixed Priority Scheduling, Earliest Deadline First (EDF) is the second leg on top of which a large portion of the research on real-timesystems stands. At the heart of the EDF exact schedulability test, a pivotal role is played by the demand bound function test, which requires to evaluate whether the amount of work required to complete a set of jobs is less than or equal to the amount of time available. Such a test is checked over a set of time instants. In this paper, it is proposed a method that cuts drastically the set of constraints to be checked. Such a method is applicable also to tasks with release offset. Notably, it is proved that such a reduced set of constraints is minimal: it is not possible to reduce the set any further without losing the sufficiency of the test. the code to make this reduction is publicly available on Github.
Enhanced Distributed Channel Access (EDCA) is a distributed control protocol to guarantee the network quality of service (QoS). It extends the access mode based on the traditional IEEE 802.11, and becomes an effective...
详细信息
Traffic sign recognition systems are vital in real-world applications such as auto-driving and safety and driver assistance. While deep neural networks have achieved high accuracy in classifying traffic signs in recen...
详细信息
ISBN:
(纸本)9781665402095
Traffic sign recognition systems are vital in real-world applications such as auto-driving and safety and driver assistance. While deep neural networks have achieved high accuracy in classifying traffic signs in recent years, there is always the discussion of the high computations of these networks and their many teachable parameters. A significant challenge is to design a compact deep neural network for the application of traffic sign recognition. this paper proposes a network that uses residual blocks in the network to obtain a top-1 accuracy of 99.51 for the German traffic sign recognition benchmark. the number of parameters is ~430,000, which is ~32x fewer than the state-of-the-art. Experiments have been performed to show the network's resistance to destructive factors and its comprehensiveness in the application of traffic sign recognition. these tests show that it is a comprehensive and robust network for the recognition of traffic signs.
Static worst-case execution time analysis enables to obtain guaranteed timing bounds for programs, which is required for safety-critical hard real-timesystems. this comprises micro-architectural analyses that rely on...
详细信息
ISBN:
(纸本)9781728131979
Static worst-case execution time analysis enables to obtain guaranteed timing bounds for programs, which is required for safety-critical hard real-timesystems. this comprises micro-architectural analyses that rely on full knowledge of the executed program. An example are current approaches to statically bound the time penalty of mispredicted branches in systems using static or dynamic branch predictors. On the other hand, in artificial software diversity, uncertainty in program aspects is used to render code-reuse attacks useless, making the system considerably more secure. We solve this conflict by proposing adapted static analyses for static and dynamic branch prediction that are able to cope with diversity, and by quantifying the impact of diversity onto the analysis results through extensive evaluation.
Mixed-criticality (MC) scheduling has been proposed for embeddedreal-timesystems to alleviate the dilemma between runtime resource utilization and worst-case temporal guarantees for critical functions. the approach ...
详细信息
ISBN:
(纸本)9781728131979
Mixed-criticality (MC) scheduling has been proposed for embeddedreal-timesystems to alleviate the dilemma between runtime resource utilization and worst-case temporal guarantees for critical functions. the approach of dropping all low-criticality tasks upon a mode switch has been criticized for potentially over-degraded performance. In this paper, we focus on the graceful degradation for MC scheduling by providing bounded lateness for certain low-critical tasks. We define MCQOS-schedulability that massages the required bounded lateness into the definition of conventional MC-schedulability. A virtual deadline based scheduler (EDF-VDS) is proposed with utilization-based MCQOS-schedulability test and and closed-form lateness bounds.
暂无评论