Token-based Mechanism Research Articles

TokenSmart: Distributed, Scalable Power Management in the Many-core Era

Centralized power management control systems are hitting a scalability limit. In particular, enforcing a power cap in a many-core system in a performance-friendly manner is quite challenging. Today’s on-chip controller reduces the clock speed of compute domains in response to local or global power limit alerts. However, this is opaque to the operating system (OS), which continues to request higher clock frequency based on the workload characteristics acting against the centralized on-chip controller. To address these issues, we introduce TokenSmart, which implements a set of scalable distributed frequency control heuristics within the OS, using a novel token-based mechanism. The number of system-allocated power tokens represents the maximum allowable power consumption; and the OS governor orchestrates a token-passing (or sharing) algorithm between the compute engines. Token allocation count increase (decrease) corresponds to a increase (decrease) of clock frequency. The compute units are connected in a ring-topology allowing minimal meta-data to be passed along with the token value for regulating power budget. We explore different heuristics to assign tokens smartly across the units. This results in efficient power regulation and sustenance of turbo frequencies over a longer duration. Our proposed methodology can be implemented in hardware with multiple on-chip controllers, or in software where each set of cores acts as a compute unit. The methodology is currently implemented within the Linux kernel of a real IBM POWER9 many-core system and experimentally verified on different real world workloads such as Redis, Cassandra, PostgreSQL along with a micro-benchmark such as rt-app. Our experiments indicate the increase in throughput for all the workloads along with the benefit of power savings. For instance, results show a considerable boost of about 4% in throughput of both the PostgreSQL and Redis benchmark with a substantial savings in power consumption (18% and 37%, respectively). If the approach is implemented in hardware, then our experimental analysis speculates the throughput to increase up to 14% in PostgreSQL benchmark.

TokenSmart: Distributed, Scalable Power Management in the Many-Core Era

Centralized power management control systems are hitting a scalability limit. In particular, enforcing a power cap in a many-core system in a performance-friendly manner is quite challenging. Today’s on-chip controller reduces the clock speed of compute domains in response to local or global power limit alerts. However, this is transparent to the operating system (OS), which continues to request higher clock frequency based on the workload characteristics acting against the centralized on chip controller. To address these issues, we introduce TokenSmart, which implements a scalable distributed frequency control heuristics within the OS, using a novel token-based mechanism. The compute units are connected in a ring-topology allowing minimal meta-data to be passed along with the token value for regulating power budget. We explore different heuristics to assign tokens smartly across the units. This results in efficient power regulation and sustenance of turbo frequencies over a longer duration. The methodology is implemented within the Linux kernel of a real IBM POWER9 many-core system. The experimental results show a considerable boost of about 4 percent in throughput of PostgreSQL benchmark with a tangible 18 percent decrease in power consumption.

Privacy-Preserving Authentication Scheme for Connected Electric Vehicles Using Blockchain and Zero Knowledge Proofs

With the increasing interest in connected vehicles along with electrification opportunities, there is an ongoing effort to automate the charging process of electric vehicles (EVs) through their capabilities to communicate with the infrastructure and each other. However, charging EVs takes time and thus in-advance scheduling is needed. As this process is done frequently due to limited mileage per charge on EVs, it may expose the locations and charging pattern of the EV to the service providers, raising privacy concerns for their users. Nevertheless, the EV still needs to be authenticated to charging providers, which means some information will need to be provided anyway. While there have been many studies to address the problem of privacy-preserving authentication for vehicular networks, such solutions will be void if charging payments are made through traditional means. In this paper, we tackle this problem by utilizing distributed applications enabled by Blockchain and smart contracts. We adapt zero-knowledge proofs to Blockchain for enabling privacy-preserving authentication while removing the need for a central authority. We introduce two approaches, one using a token-based mechanism and another utilizing the Pederson Commitment scheme to realize anonymous authentication. We also describe a protocol for the whole process which includes scheduling and charging operations. The evaluation of the proposed approaches indicates that the overhead of this process is affordable to enable real-time charging operations for connected EVs.

IoT‐enabled dependable control for solar energy harvesting in smart buildings

Efficiency and reliability have been essential requirements for energy generation in smart cities. This study presents the design and development of dependable control schemes for microgrid management, which can be seamlessly integrated into the management system of smart buildings. Here, to recover from failures in the solar energy system of a building microgrid, dependable controllers are proposed along with their hardware implementation. The system features the use of Internet of Things (IoT) as its core to coordinate the operation of multiple subsystems in a scalable manner. The control scheme uses a number of controllers cooperatively functioning via a token-based mechanism within the network to provide redundancy and thus reliability in solar tracking. The system exploits data from not only local in-situ sensors but also online sources via IoT networks for fault-tolerant control. Experiments conducted in a 12-storey building indicate that the harvested solar energy meets the design requirement while the control reliability is maintained in face of communication or hardware disruptions. The results confirmed the validity of the proposed approach and its applicability to energy management in smart buildings.

A comprehensive study of the use of advertisements as incentives in P2P streaming systems

P2P streaming systems, such as PPLive and PPStream, have become popular services with the widespread deployment of broadband networks. However, P2P streaming systems still face free-riding problems, similar to those that have been observed in P2P file sharing systems. Thus, one important problem in providing streaming services is that of providing appropriate incentives for peers to contribute their upload capacity. To this end, we propose the use of advertisements as an incentive for peers to contribute upload capacity. In the proposed framework, peers enjoy the same quality of streamed media, with the difference in quality of service being achieved through different amounts of advertisements viewed, based on the resource contributions to the system. Moreover, since calculating peers’ contributions accurately is important to successfully deploying such systems, we design a token-based framework to address this problem. An extensive simulation-based study is performed to evaluate the proposed approach. The results demonstrate that our approach provides appropriate incentives for peers to contribute their resources. Furthermore, we explore several characteristics of the token-based mechanism which can provide system developers with insight into efficient development of such systems.

A Fault-Tolerant Token-Based Atomic Broadcast Algorithm

Many atomic broadcast algorithms have been published in the last 20 years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service and none of them uses unreliable failure detectors directly. This paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector instead of a group membership service. It requires a system size that is quadratic in the number of supported failures. The special case of a single supported failure (f=1) requires n=3 processes. We experimentally evaluate the performance of this algorithm in local and wide area networks, in order to emphasize that atomic broadcast is efficiently implemented by combining a failure detector and a token-based mechanism. The evaluation shows that the new token-based algorithm surpasses the performance of the other algorithms in most small-system settings.

A Distributed Dynamic Channel Allocation Scheme in Cellular Communication Networks

This article presents a description and performance evaluation of an efficient distributed dynamic channels allocation (DDCA) scheme, which can be used for channel allocation in cellular communication networks (CCNs), such as the global system for mobile communication (GSM). The scheme utilizes a well-known distributed artificial intelligence (DAI) algorithm, namely, the asynchronous weak-commitment (AWC) algorithm, in which a complete solution is established by extensive communication among a group of neighbouring collaborative cells forming a pattern, where each cell in the pattern uses a unique set of channels. To minimize communication overhead among cells, a token-based mechanism was introduced. The scheme achieved excellent average allocation efficiencies of over 85% for a number of simulations.

An access protocol for supporting multiple classes of service in a local wireless environment

This paper presents a time split token-based contention resolution (TS-TBCR) protocol for providing multiple classes of traffic access to a shared wireless media. Since the protocol requires immediate response from the base station, it is best suited for short-range wireless applications. The key feature of the protocol is that it allows multiplexing of various services with high throughput even under heavy traffic loads. The protocol provides near perfect scheduling of information transfer by reserving a small part of the bandwidth for contention resolution. This resolves contention in an a priori manner, thus preventing collisions and leading to high channel bandwidth utilization. This protocol allows the system to support a high load while keeping packet loss probability within acceptable limits. Using a token-based mechanism, the protocol implements an access scheme, as well as a service (scheduling) discipline. The protocol is analytically modeled and extensive simulations performed to evaluate its performance. Results indicate that for multimedia traffic transport, the protocol can dynamically, and without any centralized control, realize any service discipline from first-in first-out (FIFO: complete fairness) to head-of-line (HOL: complete biasing), merely based on the relative service requirements of the traffic classes. This brings in fairness since no service class is excessively penalized.