UNICORE D2.3 Platform Requirements
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
UNICORE OPTIMIZATION William Jalby
UNICORE OPTIMIZATION William Jalby LRC ITA@CA (CEA DAM/ University of Versailles St-Quentin-en-Yvelines) FRANCE 1 Outline The stage Key unicore performance limitations (excluding caches) Multimedia Extensions Compiler Optimizations 2 Abstraction Layers in Modern Systems Application Algorithm/Libraries CS Programming Language Original Compilers/Interpreters domain of Operating System/Virtual Machines Domain of the computer recent architect Instruction Set Architecture (ISA) computer architecture (‘50s-’80s) Microarchitecture (‘90s) Gates/Register-Transfer Level (RTL) Circuits EE Devices Physics Key issue Application Algorithm/Libraries Understand the We have to take into relationship/interaction account the between Architecture intermediate layers Microarchitecture and Applications/Algorithms Microarchitecture KEY TECHNOLOGY: Don’t forget also the lowest layers Performance Measurement and Analysis Performance Measurement and Analysis AN OVERLOOKED ISSUE HARDWARE VIEW: mechanism description and a few portions of codes where it works well (positive view) COMPILER VIEW: aggregate performance number (SPEC), little correlation with hardware Lack of guidelines for writing efficient programs Uniprocessor Performance From Hennessy and Patterson, Computer Architecture: A Quantitative Approach, 4th edition, October, 2006 - VAX: 25%/year 1978 to 1986 - RISC + x86: 52%/year 1986 to 2002 RISC + x86: ??%/year 2002 to present Trends Unicore Performance REF: Mikko Lipasti-University of [source: Intel] Wisconsin Modern Unicore Stage KEY PERFORMANCE -
Evaluating Inclusion, Equality, Security, and Privacy in Pseudonym Parties and Other Proofs of Personhood
Identity and Personhood in Digital Democracy: Evaluating Inclusion, Equality, Security, and Privacy in Pseudonym Parties and Other Proofs of Personhood Bryan Ford Swiss Federal Institute of Technology in Lausanne (EPFL) November 5, 2020 Abstract of enforced physical security and privacy can address the coercion and vote-buying risks that plague today’s E- Digital identity seems at first like a prerequisite for digi- voting and postal voting systems alike. We also examine tal democracy: how can we ensure “one person, one vote” other recently-proposed approaches to proof of person- online without identifying voters? But the full gamut of hood, some of which offer conveniencessuch as all-online digital identity solutions – e.g., online ID checking, bio- participation. These alternatives currently fall short of sat- metrics, self-sovereign identity, and social/trust networks isfying all the key digital personhood goals, unfortunately, – all present severe flaws in security, privacy, and trans- but offer valuable insights into the challenges we face. parency, leaving users vulnerable to exclusion, identity loss or theft, and coercion. These flaws may be insur- mountable because digital identity is a cart pulling the Contents horse. We cannot achieve digital identity secure enough to support the weight of digital democracy, until we can 1 Introduction 2 build it on a solid foundation of digital personhood meet- ing key requirements. While identity is about distinguish- 2 Goals for Digital Personhood 4 ing one person from another through attributes or affilia- tions, personhood is about giving all real people inalien- 3 Pseudonym Parties 5 able digital participation rights independent of identity, 3.1 Thebasicidea. -
Applicability and Appropriateness of Distributed Ledgers Consensus Protocols in Public and Private Sectors: a Systematic Review
Received February 13, 2019, accepted February 27, 2019, date of publication March 21, 2019, date of current version April 13, 2019. Digital Object Identifier 10.1109/ACCESS.2019.2904181 Applicability and Appropriateness of Distributed Ledgers Consensus Protocols in Public and Private Sectors: A Systematic Review A. SHAHAAB 1, B. LIDGEY2, C. HEWAGE 1, AND I. KHAN1 1Cardiff School of Technologies, Cardiff Metropolitan University, Cardiff, CF5 2YB, U.K. 2Companies House, Cardiff, CF14 3UZ, U.K. Corresponding author: A. Shahaab ([email protected]) This work was supported by the Knowledge Economy Skills Scholarships through a major pan-Wales operation supported by the European Social Funds through the Welsh Government, and through Companies House, U.K., under Grant CMK219. ABSTRACT Advancement of consensus protocols in recent years has enabled distributed ledger technologies (DLTs) to find its application and value in sectors beyond cryptocurrencies. Here we reviewed 66 known consensus protocols and classified them into philosophical and architectural categories, also providing a visual representation. As a case study, we focus on the public sector and highlighted potential protocols. We have also listed these protocols against basic features and sector preference in a tabular format to facilitate selection. We argue that no protocol is a silver bullet, therefore should be selected carefully, considering the sector requirements and environment. INDEX TERMS Blockchain technology, consensus algorithms, distributed consensus protocols, distributed ledger technology, DLTs for public sector, distributed systems, Govtech, permissioned and permissionless blockchains. I. INTRODUCTION information across a distributed ledger. The objective of all Achieving consensus is a fundamental problem in distributed of these attempts is to achieve availability and consistency computing. -
Computer Architecture Techniques for Power-Efficiency
MOCL005-FM MOCL005-FM.cls June 27, 2008 8:35 COMPUTER ARCHITECTURE TECHNIQUES FOR POWER-EFFICIENCY i MOCL005-FM MOCL005-FM.cls June 27, 2008 8:35 ii MOCL005-FM MOCL005-FM.cls June 27, 2008 8:35 iii Synthesis Lectures on Computer Architecture Editor Mark D. Hill, University of Wisconsin, Madison Synthesis Lectures on Computer Architecture publishes 50 to 150 page publications on topics pertaining to the science and art of designing, analyzing, selecting and interconnecting hardware components to create computers that meet functional, performance and cost goals. Computer Architecture Techniques for Power-Efficiency Stefanos Kaxiras and Margaret Martonosi 2008 Chip Mutiprocessor Architecture: Techniques to Improve Throughput and Latency Kunle Olukotun, Lance Hammond, James Laudon 2007 Transactional Memory James R. Larus, Ravi Rajwar 2007 Quantum Computing for Computer Architects Tzvetan S. Metodi, Frederic T. Chong 2006 MOCL005-FM MOCL005-FM.cls June 27, 2008 8:35 Copyright © 2008 by Morgan & Claypool All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means—electronic, mechanical, photocopy, recording, or any other except for brief quotations in printed reviews, without the prior permission of the publisher. Computer Architecture Techniques for Power-Efficiency Stefanos Kaxiras and Margaret Martonosi www.morganclaypool.com ISBN: 9781598292084 paper ISBN: 9781598292091 ebook DOI: 10.2200/S00119ED1V01Y200805CAC004 A Publication in the Morgan & Claypool Publishers -
Installation Guide for UNICORE Server Components
Installation Guide for UNICORE Server Components Installation Guide for UNICORE Server Components UNICORE Team July 2015, UNICORE version 7.3.0 Installation Guide for UNICORE Server Components Contents 1 Introduction1 1.1 Purpose and Target Audience of this Document.................1 1.2 Overview of the UNICORE Servers and some Terminology...........1 1.3 Overview of this Document............................2 2 Installation of Core Services for a Single Site3 2.1 Basic Scenarios..................................3 2.2 Preparation....................................5 2.3 Installation....................................6 2.4 Security Settings................................. 15 2.5 Installation of the Perl TSI and TSI-related Configuration of the UNICORE/X server....................................... 18 2.6 The Connections Between the UNICORE Components............. 20 3 Operation of a UNICORE Installation 22 3.1 Starting...................................... 22 3.2 Stopping...................................... 22 3.3 Monitoring.................................... 22 3.4 User Management................................. 22 3.5 Testing your Installation............................. 23 4 Integration of Another Target System 24 4.1 Configuration of the UNICORE/X Service.................... 24 4.2 Configuration of Target System Interface..................... 25 4.3 Addition of Users to the XUUDB........................ 26 4.4 Additions to the Gateway............................. 26 5 Multi-Site Installation Options 26 5.1 Multiple Registries............................... -
Sybil Attacks on Identity-Augmented Proof-Of-Stake
King’s Research Portal DOI: 10.1016/j.comnet.2021.108424 Document Version Early version, also known as pre-print Link to publication record in King's Research Portal Citation for published version (APA): Platt, M., & McBurney, P. (2021). Sybil Attacks on Identity-Augmented Proof-of-Stake. COMPUTER NETWORKS , 199, [108424]. https://doi.org/10.1016/j.comnet.2021.108424 Citing this paper Please note that where the full-text provided on King's Research Portal is the Author Accepted Manuscript or Post-Print version this may differ from the final Published version. If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on the Research Portal, if citing you are again advised to check the publisher's website for any subsequent corrections. General rights Copyright and moral rights for the publications made accessible in the Research Portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognize and abide by the legal requirements associated with these rights. •Users may download and print one copy of any publication from the Research Portal for the purpose of private study or research. •You may not further distribute the material or use it for any profit-making activity or commercial gain •You may freely distribute the URL identifying the publication in the Research Portal Take down policy If you believe that this document breaches copyright please contact [email protected] providing details, and we will remove access to the work immediately and investigate your claim. -
Coins, Clubs, and Crowds: Scaling and Decentralization in Next-Generation Blockchains
Coins, Clubs, and Crowds: Scaling and Decentralization in Next-Generation Blockchains Prof. Bryan Ford Decentralized and Distributed Systems (DEDIS) School of Information and Communications (IC) [email protected] – dedis.epfl.ch Vienna BDLT Summer School – September 3, 2019 Where there’s data, there’s risk... Access, sharing compounds risk Weakest-Link Security “You can trust us!” Shared Access Partner A Business Partner B Partner C “All of us!” A Fundamental Challenge In today’s IT systems, security is an afterthought ● Designs embody “weakest-link” security Scaling to bigger systems → weaker security ● Greater chance of any “weak link” breaking Central Databases = Attractive Targets One of three credit rating agencies in the US ● Exposed sensitive personal information about 143 million people (44% of US population) The DEDIS lab at EPFL: Mission Design, build, and deploy secure privacy-preserving Decentralized and Distributed Systems (DEDIS) • Distributed: spread widely across the Internet & world • Decentralized: independent participants, no central authority, no single points of failure or compromise Overarching theme: building decentralized systems that distribute trust widely with strongest-link security Strongest-Link Security Weakest-Link Security Turning Around the Security Game Design IT systems so that making them bigger makes their security increase instead of decrease Weakest-link Strongest-link Scalable security security Strongest-link security DEDIS Laboratory Members Bryan Ford Philipp Jovanovic Associate Professor Postdoctoral Scholar Lefteris Kokoris-Kogias Kirill Nikitin Cristina Basescu Enis Ceyhun Alp Ph.D. Student Ph.D. Student Ph.D. Student Ph.D. Student Jeff R. Allen Kelong Cong Gaylor Bosson Noémien Kocher Software Engineer Software Engineer Software Engineer Software Engineer Today’s Hot Decentralized Technology (credit: Tony Arcieri) Bitcoin (2008) First successful decentralized cryptocurrency… How to track wealth (or anything)? Things Ledgers ● Gold, beads, cash.. -
Intel's High-Performance Computing Technologies
Intel’s High-Performance Computing Technologies 11th ECMWF Workshop Use of HIgh Performance Computing in Meteorology Reading, UK 26-Oct-2004 Dr. Herbert Cornelius Advanced Computing Center Intel EMEA Advanced Computing on Intel® Architecture Intel HPC Technologies October 2004 HPC continues to change … *Other brands and names are the property of their respective owners •2• Advanced Computing on Intel® Architecture Intel HPC Technologies October 2004 Some HPC History 1960s 1970s 1980s 1990s 2000s HPC Systems 1970s 1980s 1990s 2000s Processor proprietary proprietary COTS COTS Memory proprietary proprietary COTS COTS Motherboard proprietary proprietary proprietary COTS Interconnect proprietary proprietary proprietary COTS OS, SW Tools proprietary proprietary proprietary mixed COTS: Commercial off the Shelf (industry standard) *Other brands and names are the property of their respective owners •3• Advanced Computing on Intel® Architecture Intel HPC Technologies October 2004 High-Performance Computing with IA Source: http://www.top500.org/lists/2004/06/2/ Source: http://www.top500.org/lists/2004/06/5/ 4096 (1024x4) Intel® Itanium® 2 processor based system 2500 (1250x2) Intel® Xeon™ processor based system 22.9 TFLOPS peak performance 15.3 TFLOPS peak performance PNNL RIKEN 9 1936 Intel® Itanium® 2 processor cluster 7 2048 Intel® Xeon™ processor cluster 11.6 / 8.6 TFLOPS Rpeak/Rmax 12.5 / 8.7 TFLOPS Rpeak/Rmax *Other brands and names are the property of their respective owners •4• Advanced Computing on Intel® Architecture Intel HPC Technologies -
Sok: Layer-Two Blockchain Protocols
SoK: Layer-Two Blockchain Protocols Lewis Gudgeon1, Pedro Moreno-Sanchez2, Stefanie Roos3, Patrick McCorry4, and Arthur Gervais1;5;6 1 Imperial College London, United Kingdom 2 TU Wien, Austria 3 TU Delft, Netherlands 4 PISA Research, United Kingdom 5 Lucerne University of Applied Sciences and Arts, Switzerland 6 Liquidity Network, Switzerland Abstract. Blockchains have the potential to revolutionize markets and services. However, they currently exhibit high latencies and fail to handle transaction loads comparable to those managed by traditional financial systems. Layer-two protocols, built on top of (layer-one) blockchains, avoid disseminating every transaction to the whole network by exchang- ing authenticated transactions off-chain. Instead, they utilize the expen- sive and low-rate blockchain only as a recourse for disputes. The promise of layer-two protocols is to complete off-chain transactions in sub-seconds rather than minutes or hours while retaining asset security, reducing fees and allowing blockchains to scale. We systematize the evolution of layer-two protocols over the period from the inception of cryptocurrencies in 2009 until today, structuring the multifaceted body of research on layer-two transactions. Categorizing the research into payment and state channels, commit-chains and pro- tocols for refereed delegation, we provide a comparison of the protocols and their properties. We provide a systematization of the associated syn- chronization and routing protocols along with their privacy and security aspects. This Systematization of Knowledge (SoK) clears the layer-two fog, highlights the potential of layer-two solutions and identifies their unsolved challenges, indicating propitious avenues of future work. Keywords: Applied Cryptography, Blockchain Applications, Layer-Two Blockchain Protocols, Blockchain Scaling, Cryptocurrency Adoption 1 Introduction Blockchains offer a mechanism through which mutually mistrusting entities can cooperate in the absence of a trusted third party. -
Implementing Production Grids William E
Implementing Production Grids William E. Johnston a, The NASA IPG Engineering Team b, and The DOE Science Grid Team c Contents 1 Introduction: Lessons Learned for Building Large-Scale Grids ...................................... 3 5 2 The Grid Context .................................................................................................................. 3 The Anticipated Grid Usage Model Will Determine What Gets Deployed, and When. 7 3.1 Grid Computing Models ............................................................................................................ 7 3 1.1 Export Existing Services .......................................................................................................... 7 3 1.2 Loosely Coupled Processes ..................................................................................................... 7 3.1 3 WorlqTow Managed Processes .............................................................................. 8 3.1 4 Distributed-Pipelined / Coupled processes ............................................................................. 9 3.1 5 Tightly Coupled Processes ........................................................................ 9 3.2 Grid Data Models ..................................................................................................................... 10 3.2.1 Occasional Access to Multiple Tertiary Storage Systems ..................................................... 11 3.2.2 Distributed Analysis of Massive Datasets Followed by Cataloguing and Archiving ........... -
DC DMV Communication Related to Reinstating Suspended Driver Licenses and Driving Privileges (As of December 10, 2018)
DC DMV Communication Related to Reinstating Suspended Driver Licenses and Driving Privileges (As of December 10, 2018) In accordance with District Law L22-0175, Traffic and Parking Ticket Penalty Amendment Act of 2017, the DC Department of Motor Vehicles (DC DMV) has reinstated driver licenses and driving privileges for residents and non-residents whose credential was suspended for one of the following reasons: • Failure to pay a moving violation; • Failure to pay a moving violation after being found liable at a hearing; or • Failure to appear for a hearing on a moving violation. DC DMV is mailing notification letters to residents and non-residents affected by the law. District residents who have their driver license or learner permit, including commercial driver license (CDL), reinstated and have outstanding tickets are boot eligible if they have two or more outstanding tickets. If a District resident has an unpaid moving violation in a different jurisdiction, then his or her driving privileges may still be suspended in that jurisdiction until the moving violation is paid. If the resident’s driver license or CDL is not REAL ID compliant (i.e., there is a black star in the upper right-hand corner) and expired, then to renew the credential, the resident will need to provide DC DMV with: • One proof of identity; • One proof of Social Security Number; and • Two proofs of DC residency. If the resident has a name change, then additional documentation, such as a marriage license, divorce order, or name change court order is required. DC DMV only accepts the documents listed on its website at www.dmv.dc.gov. -
A Theoretical Treatment of Blockchain Scaling Protocols
Research Collection Doctoral Thesis A Theoretical Treatment of Blockchain Scaling Protocols Author(s): Avarikioti, Georgia Publication Date: 2021 Permanent Link: https://doi.org/10.3929/ethz-b-000473637 Rights / License: Creative Commons Attribution 4.0 International This page was generated automatically upon download from the ETH Zurich Research Collection. For more information please consult the Terms of use. ETH Library Diss. ETH No. 27442 A Theoretical Treatment of Blockchain Scaling Protocols A dissertation submitted to attain the degree of Doctor of Sciences of ETH Zurich (Dr. sc. ETH Zurich) presented by Georgia Avarikioti M.Sc., National and Kapidostrian University of Athens born on 14 July 1988 citizen of Greece accepted on the recommendation of Prof. Dr. R. Wattenhofer, examiner Prof. Dr. M. Maffei, Prof. Dr. A. Miller, co-examiners 2021 First Edition 2021 Copyright © 2021 by Georgia Avarikioti Series in Distributed Computing, Volume 35 TIK-Schriftenreihe-Nr. 187 iii In loving memory of my dearest friend Marisa, keeping the promise we once made to change this unjust world. iv v Rather than love, than money, than fame, give me truth. - Henry David Thoreau vi Acknowledgements First and foremost, I want to thank my PhD advisor, Prof. Roger Wattenhofer, for this beautiful journey. Roger was more than an advisor, a mentor and a friend, through these years. Our meetings were always a time of joy and clarity, be it in scientific matters, or simply discussions about society and life. Apart from the academic guidance, Roger instilled in me confidence and trust in myself, which I was severely lacking coming from a different background (especially when he was losing in Tichu!).