THIS TEXT WILL NOT BE SHOWN DURING PRESENTATION! Design by Jon Angelo Gjetting Reproducability not allowed without explicit.

Slides:



Advertisements
Similar presentations
Network II.5 simulator ..
Advertisements

Chapter 13: I/O Systems I/O Hardware Application I/O Interface
All rights reserved © 2006, Alcatel Grid Standardization & ETSI (May 2006) B. Berde, Alcatel R & I.
Chapter 5 Input/Output 5.1 Principles of I/O hardware
Eduardo Cuervo - Duke Aruna Balasubramanian - U Mass Amherst Dae-ki Cho - UCLA Alec Wolman, Stefan Saroiu, Ranveer Chandra, Paramvir Bahl – Microsoft Research.
Cache Storage For the Next Billion Students: Anirudh Badam, Sunghwan Ihm Research Scientist: KyoungSoo Park Presenter: Vivek Pai Collaborator: Larry Peterson.
CPS216: Data-Intensive Computing Systems Data Access from Disks Shivnath Babu.
Chapter 8 Interfacing Processors and Peripherals.
I/O InterfaceCS510 Computer ArchitecturesLecture Lecture 17 I/O Interfaces and I/O Busses.
IT253: Computer Organization
COMP375 Computer Architecture and Organization Senior Review.
Disk Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
Overview of Mass Storage Structure
I/O Chapter 8. Outline Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.
Lecture 12: MapReduce: Simplified Data Processing on Large Clusters Xiaowei Yang (Duke University)
- Dr. Kalpakis CMSC Dr. Kalpakis 1 Outline In implementing DBMS we need to answer How should the system store and manage very large amounts of data?
Interactive lesson about operating system
Categories of I/O Devices
THIS TEXT WILL NOT BE SHOWN DURING PRESENTATION! Design by Jon Angelo Gjetting Reproducability not allowed without explicit.
WebCafé Slide No:1 World Cyber Cafe Association Brings to You Webcafe A Cyber Café Management Software A Software That Will Boost Your Efficiency For Managing.
1 CS533 Modeling and Performance Evaluation of Network and Computer Systems Capacity Planning and Benchmarking (Chapter 9)
Part IV: Memory Management
Cloud Storage in Czech Republic Czech national Cloud Storage and Data Repository project.
Choosing a PC Before you choose a PC you need to think about what it is going to be used for.
Top Causes for Poor Application Performance Case Studies Mike Canney.
1 Web Server Performance in a WAN Environment Vincent W. Freeh Computer Science North Carolina State Vsevolod V. Panteleenko Computer Science & Engineering.
1 Advanced Database Technology February 12, 2004 DATA STORAGE (Lecture based on [GUW ], [Sanders03, ], and [MaheshwariZeh03, ])
I/O Hardware n Incredible variety of I/O devices n Common concepts: – Port – connection point to the computer – Bus (daisy chain or shared direct access)
1 External Sorting for Query Processing Yanlei Diao UMass Amherst Feb 27, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
By Mr. Abdalla A. Shaame 1. What is Computer An electronic device that stores, retrieves, and processes data, and can be programmed with instructions.
Efficient Instruction Set Randomization Using Software Dynamic Translation Michael Crane Wei Hu.
Chapter 13: I/O Systems I/O Hardware Application I/O Interface
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Department of Computer Science Southern Illinois University Edwardsville Dr. Hiroshi Fujinoki and Kiran Gollamudi {hfujino,
For more notes and topics visit:
University of Bergen public domain software: SEISLOG Linux, data-acquisition system for standard PC and embedded lowcost, low-power solutions Terje Utheim.
Report : Zhen Ming Wu 2008 IEEE 9th Grid Computing Conference.
Lecturer: Ghadah Aldehim
I/O – Chapter 8 Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.
DBI313. MetricOLTPDWLog Read/Write mixMostly reads, smaller # of rows at a time Scan intensive, large portions of data at a time, bulk loading Mostly.
A Measurement Based Memory Performance Evaluation of High Throughput Servers Garba Isa Yau Department of Computer Engineering King Fahd University of Petroleum.
External Storage Primary Storage : Main Memory (RAM). Secondary Storage: Peripheral Devices –Disk Drives –Tape Drives Secondary storage is CHEAP. Secondary.
CS246 Data & File Structures Lecture 1 Introduction to File Systems Instructor: Li Ma Office: NBC 126 Phone: (713)
CS /02 Semester II Help Session I/O Colin Tan, S ,
CPSC 404, Laks V.S. Lakshmanan1 External Sorting Chapter 13: Ramakrishnan & Gherke and Chapter 2.3: Garcia-Molina et al.
Programming for GCSE Topic 5.1: Memory and Storage T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
1 UNIT 13 The World Wide Web Lecturer: Kholood Baselm.
Empirical Quantification of Opportunities for Content Adaptation in Web Servers Michael Gopshtein and Dror Feitelson School of Engineering and Computer.
12/8/20151 Operating Systems Design (CS 423) Elsa L Gunter 2112 SC, UIUC Based on slides by Roy Campbell, Sam King,
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
ITGS Network Architecture. ITGS Network architecture –The way computers are logically organized on a network, and the role each takes. Client/server network.
Newsgroup World Wide Web (WWW) Conservation Over the Internet e.g.ICQ File Transfer Protocol (FTP) Includes 6 main services: Electronic Mail Remote.
Am I RAM Or am I ROM?.
Slide 1/29 Informed Prefetching in ROOT Leandro Franco 23 June 2006 ROOT Team Meeting CERN.
Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
COMP7500 Advanced Operating Systems I/O-Aware Load Balancing Techniques Dr. Xiao Qin Auburn University
1 UNIT 13 The World Wide Web. Introduction 2 Agenda The World Wide Web Search Engines Video Streaming 3.
1 UNIT 13 The World Wide Web. Introduction 2 The World Wide Web: ▫ Commonly referred to as WWW or the Web. ▫ Is a service on the Internet. It consists.
Computer System Structures Storage
Chapter 10: Mass-Storage Systems
Dynamic Extension of the INFN Tier-1 on external resources
Exam 2 Review.
The Client/Server Database Environment
Web Caching? Web Caching:.
Memory Management for Scalable Web Data Servers
Building a Database on S3
Network Attached Storage NAS100
Chap 2. Computer Fundamentals
Chapter 13: I/O Systems I/O Hardware Application I/O Interface
Presentation transcript:

THIS TEXT WILL NOT BE SHOWN DURING PRESENTATION! Design by Jon Angelo Gjetting Reproducability not allowed without explicit written consent from Jon Angelo Gjetting. The development in Network Performance And its impact on the computing model of tomorrow

The GRiD Named after the power-grid Sometimes referred to as the information power grid Like the power-grid GRID should be powered by large installations –not individual generators

Philosophy Current Internet only allows access to information The GRiD should provide access to any desired resource –CPU/SuperComputers –Storage –Applications

Performance Improvement since 1988

Rules of the Game Copenhagen-Stockholm 1988 –Latency 40 ms –Bandwidth 64 kb/s 2005 –Latency 10 ms –Bandwidth 10Gb/s Networking is much better

Is There an Improvement? Whether we have an improvement depend on our watch!

CPU Whether we have an improvement depend on our watch! Is There an Improvement?

CPU Outer Clock Inner Clock Whether we have an improvement depend on our watch! Is There an Improvement?

Rules of the Game Copenhagen-Stockholm Using the inner clock 1988 –1B: 0.8M CPU cycles –1GB: 2T CPU cycles 2005 –1B: 39M CPU cycles –1GB: 3G CPU cycles Latency is much worse But bandwidth is much better

Rules of the Game Harddrive-Memory Using the inner clock 1988 –1B: 1M CPU cycles –1GB: 1G CPU cycles 2005 –1B: 13M CPU cycles –1GB: 38G CPU cycles Hard-drives are also much worse

Development as seen from the CPU

Why is GRID? Network bandwidth is now here

Transparent Remote File Access Huge input files incur a number of problems: –Download time vs. total execution time –Job execution on the resource is delayed –Storage requirements on resources Often only small scattered fragments of input files are needed How about automatic on-demand download of needed data?

int fd = open(inputfile, O_RDONLY); while ((i=read(fd, &buffer, 2000)) >0){ /* process buffer */ } Example User applications need not be recompiled or rewritten!

Communication Protocol HTTP supports a range parameter in get request: GET /inputfile HTTP/1.1 HOST: MiG_server.imada.sdu.dk Range: bytes= No range support in put requests –In order to support writing to remote files, a custom web server is developed

Overriding file-access Override a subset of file manipulating routines: –open, close, read, write, seek, dup, sync, etc. Preload this library using the LD_PRELOAD environment variable –Requires user apps to be dynamically linked Forward local file access to the native file system using the dlfcn library

Efficient Access Simple solution: general purpose block size based on n/2-analysis Advanced solution: depends on the user application: –The nature of the application (sequential vs non- sequential file access) –The block size used in the application Introduce prefetching (1 block read-ahead) Adjust the block size dynamically based on the prefetching and the time taken to transfer a block

Experiments 4 experiments: – Overhead: read a one byte file – I/O intensive application: Checksum a 1 GB file – I/O balanced application: Process a 1 GB file – Partial file traversal: Search a 360 MB B+ tree for a random key 3 test setups: – Local execution – Copy model – Remote access model

Baseline Performance 100Mb net ExperimentLocalCopyRemote 1B file Checksum Balanced B+ Tree

Latency tests

Checksum

Balanced

B+ Tree

True End of the PC? If we can eliminate the disk we eliminate >60% of the errors in the PC But perhaps we dont need the PC –The average PC utilizes less that 5% of its capacity (Source: Intel) Reality is that the PC is –Much too powerful most of the time –Not nearly powerful enough the rest of the time So we eliminate the PC?

Bandwidth for Remote users A graphics intensive user –Screen size: 1600x1400 –Frequency: 50Hz –Color depth: 32b –Compression 1:10 Required bandwidth: 0.33 Gb/s Translates into 30 users per 10Gb line

Bandwidth for Remote users A typical user –Screen size: 1280x1024 –Frequency: 30Hz –Color depth: 24b –Compression 1:100 Required bandwidth: Gb/s Translates into 1138 users per 10Gb line

World of Tomorrow? GRID User Resource GRID Dis k

The Grid Terminal

Grid terminal

But we have seen this before? Is this not just another thin client? No! –Thin clients work against dedicated servers –Grid has no single point of failure –And Grid has competition

Distributed Shared Memory

DSM Test – the problem… PointsLatency (us)Bandwidth (MB/s) SDU-SDU NBI-NBI SDU-NBI SDU-DIKU NBI-DIKU

The Results

Conclusion and Predictions No reason to expect any change in the development of performance Networks will be increasingly slower But bandwidth is limited only by demand Grid will allow users to ignore computer maintenance and backups Even individual home-users will join Grid

THIS TEXT WILL NOT BE SHOWN DURING PRESENTATION! Design by Jon Angelo Gjetting Reproducability not allowed without explicit written consent from Jon Angelo Gjetting.