16/5/2018 11:30Meyer 861


Security and Reliability Using OS

Noam Shalev

EE Technion

Computer systems have been developed tremendously over the past few years and as a result new challenges arise in the fields of security and reliability. In this talk I will present two approaches that utilize the operating system for providing solutions to urgent challenges in these fields. First, I will speak about the Core Surprise Removal (CSR) algorithm which explores the uncharted field of providing reliability in face of hardware faults and makes a unique use of Hardware Transactional Memory. Next, I will introduce WatchIT, a new container-based approach for protecting organizations from privileged insider threats, such as the renowned Edward Snowden case. WatchIT leverages the operating system namespace subsystem and alongside classification system and minor optional changes to the kernel proposes a comprehensive solution that was tested on a real organization.

Bio: Noam Shalev is a PhD candidate at the Electrical Engineering Faculty of the Technion, advised by Prof. Idit Keidar.

23/5/2018 11:30Meyer 861


RISC-V - Why a new CPU Architecture?

Oded Lempel

Mellanox Technologies

Who needs a new Instruction Set Architecture (ISA)? Architectures have reached some unspoken Truce through Markets Segment dominance (IA64 - PC and Server market, ARM - Mobile market). IA and ARM have ruled the PC/Server and Mobile markets, respectively, for years and have prevailed aggressive competitive assaults Some Markets are still pursuing a standard (ARM and Various DSPs - IoT market, GPGPU (Nvidia) and TPU (Google) - IA/ML applications) IoT and IA/ML segments have not yet matured and no standard has been established. They are attracting a lot of innovation that may yield a dominant standard architecture. Where is there room for a new ISA? What would lead the industry and market to move to a new market? We will focus on RISC-V, what it brings that is not available in existing Architectures, in which markets is this enough to create an Architecture change.


30/5/2018 11:30Meyer 861


Space Bounds for Reliable Coded Storage, and Beyond

Alexander Spiegelman

EE Technion

The bulk of the talk will deal with space requirements of reliable storage algorithms in asynchronous distributed systems. A number of recent works have used codes in order to achieve a better storage cost than the well-known replication approach. However, a closer look reveals that they incur extra costs in certain scenarios. Specifically, if multiple clients access the storage concurrently, then existing asynchronous code- based algorithms may store a number of copies of the data that grows linearly with the number of concurrent clients. We will show that this is inherent. Given three parameters, (1) the data size - D bits, (2) the concurrency level - c, and (3) the number of storage node failures that need to be tolerated - f, we show a lower bound of omega(min(f,c)*D) bits on the space complexity of asynchronous distributed storage algorithms. Intuitively, this implies that the asymptotic storage cost is either as high as with replication, namely O(fD), or as high under concurrency as with the aforementioned code-based algorithms, i.e., O(cD). We further present a technique for combining erasure codes with replication so as to obtain the best of both. We present an adaptive f - tolerant storage algorithm whose storage cost is O(min(f, c)*D). Together, the results show that the space complexity of providing reliable storage in asynchronous distributed systems is teta(min(f,c) * D).

I will then briefly present some results on game theoretic analysis of multi-miner multi blockchain settings. We consider a model with coins and rational miners, in which each coin divides a reward to the miners that mine for it. The payoff of each miner is proportional to the miner's power, and miners are free to change coins in order to increase their payoffs. We show that every game in this setting has an equilibrium, and moreover, every better respond dynamic leads to an equilibrium. Then, we also give a mechanism reward design to move the system between equilibriums.

Based on joint works with Yuval Cassuto, Gregory Chockler, Idit Keidar, and Moshe Tennenholtz.

Bio: Alexander Spiegelman is a PhD candidate at the Electrical Engineering Faculty of the Technion, advised by Prof. Idit Keidar.