Bøger af Rachid Guerraoui

Today, machine learning algorithms are often distributed across multiple machines to leverage more computing power and more data. However, the use of a distributed framework entails a variety of security threats. In particular, some of the machines may misbehave and jeopardize the learning procedure. This could, for example, result from hardware and software bugs, data poisoning or a malicious player controlling a subset of the machines. This book explains in simple terms what it means for a distributed machine learning scheme to be robust to these threats, and how to build provably robust machine learning algorithms.Studying the robustness of machine learning algorithms is a necessity given the ubiquity of these algorithms in both the private and public sectors. Accordingly, over the past few years, we have witnessed a rapid growth in the number of articles published on the robustness of distributed machine learning algorithms. We believe it is time to provide a clear foundation to this emerging and dynamic field. By gathering the existing knowledge and democratizing the concept of robustness, the book provides the basis for a new generation of reliable and safe machine learning schemes. In addition to introducing the problem of robustness in modern machine learning algorithms, the book will equip readers with essential skills for designing distributed learning algorithms with enhanced robustness. Moreover, the book provides a foundation for future research in this area.

Rachid RG est né et a grandi dans un Maroc post-protectorat encore doté d'une école publique de qualité qui servait d'ascenseur social, et où filles et garçons se côtoyaient librement sans l'écran des voiles encore rares. Depuis 30 ans, RG suit avec recul mais intérêt la transformation oxymorique de son pays natal, à l'instar de celle de ce que l'on appelle le monde "arabo-musulman": un progressisme latent, qui bouscule la culture et les textes sacrés, doublé d'une plongée avérée parfois désespérée, et souvent anachronique, dans la bigoterie. C'est ce contraste saisissant que RG nous fait vivre au travers des dialogues caustiques entre deux marocains, imaginaires mais représentatifs de leur société. En parcourant à travers un abécédaire les thèmes qui secouent l'opinion publique "arabo-musulmane", comme le terrorisme, la laïcité, l'arabisation, le concordisme, le blasphème, le féminisme, les crimes d'honneur, l'homosexualité, l'avortement, la tolérance, la colonisation, le voile et l'athéisme, RG souligne les contradictions et les incohérences d'un monde en pleine mutation, dont l'envie de s'émanciper n'a d'égale que la peur de voir se dérober sous ses pieds ce sol pétri de certitudes que procurent des traditions bien ancrées.

Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. Yet, a TM runs transactions concurrently to leverage the parallelism offered by modern processors. The aim of this book is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what are the power and limitations of a TM, and what inherent trade-offs are involved in designing a TM algorithm. While the focus of this book is on the fundamental principles, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations. Table of Contents: Introduction / Shared Memory Systems / Transactional Memory: A Primer / TM Correctness Issues / Implementing a TM / Further Reading / Opacity / Proving Opacity: An Example / Opacity vs.\ Atomicity / Further Reading / The Liveness of a TM / Lock-Based TMs / Obstruction-Free TMs / General Liveness of TMs / Further Reading / Conclusions

This book constitutes the refereed proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, Middleware 2001, held in Heidelberg, Germany, in November 2001.The 20 revised full papers presented were carefully reviewed and selected from a total of 116 submissions. The papers are organized in topical sections on Java, mobility, distributed abstractions, reliability, home and office, scalability, and quality of service.

This book constitutes the revised selected papers of the First International Conference on Networked Systems, NETYS 2013, held in Marrakech, Morocco, in May 2013. The 33 papers (17 regular and 16 short papers) presented were carefully reviewed and selected from 74 submissions. They address major topics from theory and practice of networked systems: multi-core architectures, middleware, environments, storage clusters, as well as peer-to-peer, sensor, wireless, and mobile networks.

The scope of this second edition of the introduction to fundamental distributed programming abstractions has been extended to cover 'Byzantine fault tolerance'. It includes algorithms to implement these abstractions in vulnerable distributed systems.