9 March 2021 in IEEE Transactions on Parallel and Distributed Systems
Despite great advancements in hardware-assisted virtualization of the x86 architecture, certain workloads still suffer significant overhead. This article dissects said overhead in the context of multi-threading. We describe the state-of-the-art, pinpoint challenges, and suggest improvements, aiming to provide a valuable reference to developers and users of virtualization systems alike. We study the virtualization overhead of the PARSEC and SPLASH2X multithreaded benchmarks in a variety of scenarios using a state-of-the-art system. Through controlled experiments, source code analysis and literature review, we quantify the virtualization overhead multithreading still induces and link it to its root causes, after which we suggest possible mitigation strategies. Multithreading still induces high virtualization overhead, mainly caused by synchronization, spinning at user level and NUMA management. The overhead is diverse in nature and embodiment as it is a function of many system and workload properties. System-level solutions are feasible, but often imply difficult trade-offs. Systematic workload optimization is a promising alternative.
31 March 2020 in IEEE Transactions on Vehicular Technology
The aim of this article is to improve vehicular traffic in terms of both travel time and load balance. To achieve this goal, we propose an optimization model that minimizes the sum of the total travel time in the road network and a time representation of the traffic imbalance effects in the network. This paper presents an analytic formulation of the optimization problem, and an algorithm, Dynamic Interior Point Method (DIPM), that solves this optimization through driver rerouting. Unlike user-optimum traffic optimizations, DIPM leads to better fairness for drivers and works well in case of congestion. Unlike other system-wide traffic optimizations, DIPM considers the effects of the driver behavior on traffic load. Together, these features allow our system to work well in a potential real-world deployment. DIPM benefits from a central server that computes driver routes, which is reachable via cellular networks or vehicular ad hoc networks. Theoretical analysis and simulation results demonstrate that DIPM is fast and can work in real-time. The results of extensive simulations with realistic urban maps and traffic scenarios show that DIPM outperforms other dynamic rerouting algorithms in terms of travel time. DIPM also improves fairness when compared with a user-optimum approach.
8 July 2015 in Journal of Computer Science and Technology
14 May 2021 in IEEE Transactions on Mobile Computing
Cruising for vacant curbside parking spaces causes waste of time, frustration, waste of fuel, and pollution. This problem has been addressed by centralized solutions that perform parking assignments and communicate them to drivers’ smart phones. These solutions suffer, however, from two intrinsic problems: scalability, as the server has to perform intensive computation and communication with the drivers; and privacy, as the drivers have to disclose their destinations to the server. This article proposes DFPS, a distributed mobile system for free parking assignment. DFPS solves the scalability problem by using the drivers’ smart phones to cooperatively compute the parking assignments, and a centralized dispatcher to receive and distribute parking requests to the network of smart phones. The phones of the parked drivers in DFPS are structured in a K-D tree to serve parking requests in a distributed fashion. DFPS removes the computation from the dispatcher and substantially reduces its communication load. DFPS solves the privacy problem through an entropy-based cloaking technique that runs on drivers’ smart phones and conceals drivers’ destinations from the dispatcher. The evaluation demonstrates that DFPS is scalable and obtains better travel time than a centralized system, while protecting the privacy of drivers’ destinations.