CAM I/O Scheduler. Netflix, Inc. AsiaBSDCon 2015
|
|
|
- Griselda Dennis
- 6 years ago
- Views:
Transcription
1 CAM I/O Schedule ワーナーラーシュ フーメー Netflix, Inc. AsiaBSDCon 2015 東京 2015 年 4 月 15 日
2 Outline Ovevie / Motivation Gaphs Roadmap Backgound and Context Netflix OCA NAND Physics and SSD FeeBSD I/O Stack Netflix I/O Schedule
3 Outline Ovevie / Motivation Gaphs Roadmap Backgound and Context Netflix OCA NAND Physics and SSD FeeBSD I/O Stack Netflix I/O Schedule
4 Motivations Big pefomance hit in ou opeations 20-50% dop in thoughput SSD epoting 100% busy ith tiny use Netflix s QoE metics sho custome poblems Taced to adding / deleting content Happened duing content fill Wok aound by idling seve befoe fill Sometimes an issue, othe times not Some systems ould have poblems, othes not No fixed patten to failue Only affected flash caches Seems elated to ite activity.
5 Maco Vie
6 Root Cause High ite okload Read latencies can spike
7 One Gaph Vie MB/s SSD Wite Latency Cliff s s s Legend s s Read MB/s Wite MB/s Read Time (ms) s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s Sevice Time (ms) Time (min) Houston, e have a poblem
8 Topics I/O Schedule CAM I/O Stack SSDs NAND Physics Netflix Wok load
9 Outline Ovevie / Motivation Gaphs Roadmap Backgound and Context Netflix OCA NAND Physics and SSD FeeBSD I/O Stack Netflix I/O Schedule
10 Netflix OCA Ovevie of Netflix s Open Connect Appliance (OCA)
11 Netflix Open Connect Appliance (OCA) OpenOpen Connect Appliances Flash DivesDives Connect Appliances Flash 14 Souce: Netflix
12 Netflix Open Connect Appliance (OCA) Diecting Clients to Caches Boadband ISP Netflix Contol Seves 3. Client connects to local cache 4. Local cache delives video steam Open Connect Appliance (OCA) Use outing is done by Netflix contol seves, not dependent on client DNS configuation Request is outed to the neaest available OCA backup URLs ae povided fo failove ISP contols client to OCA mapping/clusteing/ failove via BGP Souce: Netflix
13 Netflix Open Connect Appliance (OCA) Content Flo Open Connect Appliance (OCA) Open Connect Appliance (OCA) Manifest Sevice 1. OCA egistes ith OCA contol sevice 2. OCA contol sevice delives content manifest 3.a. Manifest Sevice compaes manifest to hat s on disk 3.b. Manifest Sevice ceates scipt to fetch ne content fom oigin 3.c. Manifest Sevice deletes content no longe needed 4. OCA submits ne manifest to OCA CS OCA Contol Sevice 5. OCA contol sevice tells Client contol sevice: a. OCA definition b. Content to cache mapping Client Contol Sevice Populaity 6. Populaity sevice tells OCA contol sevice about: a. Odeed list of popula donloadable URLs b. Donloadable file size Souce: Netflix
14 Typical Disk Activity (1 day) Lots of ead taffic Little ite taffic 100:1 ead:ite o moe atio Fill Windo needed to avoid poblem
15 NAND Flash A Bief Pime on Why and Ho NAND Flash Pesents Challenges and Ho SSDs Hide That Though Lies and Deceit Souce:
16 NAND Geomety 16 chips/package 4000 blocks/chip 500 pages/block CE Paallel Ease unit Read / Wite unit NAND typical geomety Pages ae 4kiB-32kiB (typically 16kiB) plus OOB
17 NAND Limitations Read page at a time Wite page at a time Wite pages in ode Ease entie block Single Duplex, No queuing Lo enduance ( 3k P/E cycles) Uneliable Media (ECC / LDPC needed) Paallelism though Banks / CE lines NAND Flash and FeeBSD
18 Typical SSD / NVMe Host Inteconnect Pocesso DRAM Buffe NAND Contolle NAND Chip NAND Chip NAND Chip NAND Chip Genealized block diagam of flash stoage device.
19 SSD / NVME Fimae Flash Tanslation Laye (FTL) LBA to PA tanslation Metadata fo log / NAND Wea Leveling Whee to stat iting at block bounday Which block to gabage collect Reliability Retention (data too old o ead too much) Wea out (block too on ith high RBER) Pogam / Ease eo pocessing Gabage Collection Moves data foad Exta eads and ites (Wite Amplification) Can affect pefomance
20 Effects of Gabage Collection Souce
21 Effects of Gabage Collection Souce
22 FeeBSD I/O Stack System Call Inteface Active File Enties OBJECT/VNODE File Systems Page Cache GEOM CAM Peiph Dive SD Cad CAM XPT mmc bus NVMe NAND CAM SIM Dive sdhci Nebus Bus Space busdma Afte Figue 7.1 in The Design and Implementation of the FeeBSD Opeating System, Uppe Loe
23 FeeBSD I/O Stack Uppe half of I/O Stack focus of VM system Buffe cache Memoy mapped files / devices Loosely coupled use actions to device action GEOM handles patitioning, compession, encyption Filtes data (compession, encyption) Muxes Many to one (patitioning) Muxes One to Many (stiping / RAID) Limited Scheduling CAM handles queuing Shapes flos to device Limits equests to numbe of slots Enfoces ules (eg tagged vs non-tagged) Multiplexes shaed esouces beteen devices
24 CAM Data I/O data path though CAM schedule bio dastategy(bio) bio done(bio) bioq disksot enq bio queue / delete queue deq bioq fist daschedule() dadone(ccb,bio) xpt schedule() xpt done(ccb) hile oom in devq dastat() sim int() bio use bio to fill in ccb h inteupt xpt action(ccb) simaction(ccb)
25 Outline Ovevie / Motivation Gaphs Roadmap Backgound and Context Netflix OCA NAND Physics and SSD FeeBSD I/O Stack Netflix I/O Schedule
26 FeeBSD Default I/O Schedule No diffeentiation of I/O (except BIO DELETE) Implements to odeing policies In ode elevato Implemented in the CAM PERIPH dives Most flexible Duplicated code Patial lie: SIM dives also involved (NCQ) Geneally pefoms ell fo ell behaved devices SSDs beak the ules Diffeent SSDs beak diffeent ules Assumed cost symmety often not the case
27 Anothe Look MB/s SSD Wite Latency Cliff s s s Legend s s Read MB/s Wite MB/s Read Time (ms) s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s s Sevice Time (ms) Time (min) Houston, e have a poblem
28 Netflix I/O Schedule Theoy Resticting ite ate educes ite amp distubance Fee concuent ites leaves moe banks fo eads Elevated latency OK ithin limits Loest late needed since PERIPH knos about device GEOM laye too high GEOM filtes equests, but can t foce PERIPH
29 I/O Schedule Changes Ceate abstact inteface to schedule Convet da and ada PERIPHs to ne inteface Make sue no egessions
30 Netflix I/O Schedule Changes Sepaate ead, ite and delete queues Lots of statistics Ability to limit numbe of I/O in device at a time Adjustments needed fo scheduling
31 Netflix I/O Schedule Changes schedule bio cam iosched queue ok dastategy(bio) bio done(bio) bioq disksot enq ead queue / ite queue / delete queue deq bioq fist cam iosched net bio daschedule() xpt schedule() next bio dastat() Same as above * hile oom in devq dadone(ccb,bio) xpt done(ccb) sim int() h inteupt Changes to default schedule in ed.
32 Results MB/s SSD Wite Latency Cliff Legend Read MB/s Wite MB/s s Read Time (ms) s s s s s s ss ss ss ss ss s ss s s s s ssss ss s ss s ss sss sss s ss ssss s s ss s s sssss s s s sss s s s ss s s s s ssss s s ss s s sss ss ss ssss s s s s s s s s s ss s ss ssssss s s Sevice Time (ms) Time (min) Paint it pink and ship it
33 Questions Questions? Comments? Wane Losh
Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson
Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.
Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies
Acceleating Stoage with RDMA Max Gutovoy Mellanox Technologies 2018 Stoage Develope Confeence EMEA. Mellanox Technologies. All Rights Reseved. 1 What is RDMA? Remote Diect Memoy Access - povides the ability
Pipes, connections, channels and multiplexors
Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok
UCB CS61C : Machine Structures
inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called
COSC 6385 Computer Architecture. - Pipelining
COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped
MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining
EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining
All lengths in meters. E = = 7800 kg/m 3
Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee
Computer Science 141 Computing Hardware
Compute Science 141 Computing Hadwae Fall 2006 Havad Univesity Instucto: Pof. David Books dbooks@eecs.havad.edu [MIPS Pipeline Slides adapted fom Dave Patteson s UCB CS152 slides and May Jane Iwin s CSE331/431
IP MULTICAST. Adiseshu Hari, T. V. Lakshman and Gordon Wilfong Nokia Bell Labs
IP MULTICAST Adiseshu Hai, T. V. Lakshman and Godon Wilfong Nokia DIMACS Wokshop on Algoithms fo Data Cente Netwoks Rutges Univesity, NJ 1 Why is IP Multicast not deployed in public netwoks? Denial-of-Sevice
Introduction To Pipelining. Chapter Pipelining1 1
Intoduction To Pipelining Chapte 6.1 - Pipelining1 1 Mooe s Law Mooe s Law says that the numbe of pocessos on a chip doubles about evey 18 months. Given the data on the following two slides, is this tue?
Multidimensional Testing
Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of
Module 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.
IP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc
- CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish
The Processor: Improving Performance Data Hazards
The Pocesso: Impoving Pefomance Data Hazads Monday 12 Octobe 15 Many slides adapted fom: and Design, Patteson & Hennessy 5th Edition, 2014, MK and fom Pof. May Jane Iwin, PSU Summay Pevious Class Pipeline
Any modern computer system will incorporate (at least) two levels of storage:
1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Instructor: Senior Lecturer SOE Dan Garcia
CS 61C: Geat Ideas in Compute Achitectue Pipelining Hazads Instucto: Senio Lectue SOE Dan Gacia 1 Geat Idea #4: Paallelism So9wae Paallel Requests Assigned to compute e.g. seach Gacia Paallel Theads Assigned
IP Multicast Simulation in OPNET
IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok
Physical Aware System Level Design for Tiled Hierarchical Chip Multiprocessors
Physical Awae System Level Design fo Tiled Hieachical hip Multipocessos Jodi otadella, Javie de San Pedo, Nikita Nikitin and Jodi Petit Univesitat Politècnica de atalunya (Bacelona) Poject funded by Intel
Lecture #22 Pipelining II, Cache I
inst.eecs.bekeley.edu/~cs61c CS61C : Machine Stuctues Lectue #22 Pipelining II, Cache I Wiewold cicuits 2008-7-29 http://www.maa.og/editoial/mathgames/mathgames_05_24_04.html http://www.quinapalus.com/wi-index.html
ECE331: Hardware Organization and Design
ECE331: Hadwae Oganization and Design Lectue 16: Pipelining Adapted fom Compute Oganization and Design, Patteson & Hennessy, UCB Last time: single cycle data path op System clock affects pimaily the Pogam
A Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
User Visible Registers. CPU Structure and Function Ch 11. General CPU Organization (4) Control and Status Registers (5) Register Organisation (4)
PU Stuctue and Function h Geneal Oganisation Registes Instuction ycle Pipelining anch Pediction Inteupts Use Visible Registes Vaies fom one achitectue to anothe Geneal pupose egiste (GPR) ata, addess,
Persistent Memory what developers need to know Mark Carlson Co-chair SNIA Technical Council Toshiba
Pesistent Memoy what developes need to know Mak Calson Co-chai SNIA Technical Council Toshiba 2018 Stoage Develope Confeence EMEA. All Rights Reseved. 1 Contents Welcome Pesistent Memoy Oveview Non-Volatile
Administrivia. CMSC 411 Computer Systems Architecture Lecture 5. Data Hazard Even with Forwarding Figure A.9, Page A-20
Administivia CMSC 411 Compute Systems Achitectue Lectue 5 Basic Pipelining (cont.) Alan Sussman als@cs.umd.edu as@csu dedu Homewok poblems fo Unit 1 due today Homewok poblems fo Unit 3 posted soon CMSC
Efficient Execution Path Exploration for Detecting Races in Concurrent Programs
IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent
COEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines
1 COEN-4730 Compute Achitectue Lectue 2 Review of nstuction Sets and Pipelines Cistinel Ababei Dept. of Electical and Compute Engineeing Maquette Univesity Cedits: Slides adapted fom pesentations of Sudeep
A Non-blocking Directory Protocol for Large-Scale Multiprocessors. Technical Report
A Non-blocking Diectoy Potocol fo Lage-Scale Multipocessos Technical Repot Depatment of Compute Science and Engineeing Univesity of Minnesota 4-192 EECS Building 200 Union Steet SE Minneapolis, MN 55455-0159
Monitors. Lecture 6. A Typical Monitor State. wait(c) Signal and Continue. Signal and What Happens Next?
Monitos Lectue 6 Monitos Summay: Last time A combination of data abstaction and mutual exclusion Automatic mutex Pogammed conditional synchonisation Widely used in concuent pogamming languages and libaies
An Improved Resource Reservation Protocol
Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing
A Novel Parallel Deadlock Detection Algorithm and Architecture
A Novel Paallel Deadlock Detection Aloithm and Achitectue Pun H. Shiu 2, Yudon Tan 2, Vincent J. Mooney III {ship, ydtan, mooney}@ece.atech.ed }@ece.atech.edu http://codesin codesin.ece.atech.eduedu,2
1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses
http://achvlsi.ics.foth.g/~kateveni/534 1.3 Multiplexing, Time-Switching, Point-to-Point vesus Buses n R m Aggegation (multiplexing) Distibution (demultiplexing) Simplest Netwoking, like simplest pogamming:
Using SPEC SFS with the SNIA Emerald Program for EPA Energy Star Data Center Storage Program Vernon Miller IBM Nick Principe Dell EMC
Using SPEC SFS with the SNIA Emeald Pogam fo EPA Enegy Sta Data Cente Stoage Pogam Venon Mille IBM Nick Pincipe Dell EMC v6 Agenda Backgound on SNIA Emeald/Enegy Sta fo block Intoduce NAS/File test addition;
CENG 3420 Computer Organization and Design. Lecture 07: MIPS Processor - II. Bei Yu
CENG 3420 Compute Oganization and Design Lectue 07: MIPS Pocesso - II Bei Yu CEG3420 L07.1 Sping 2016 Review: Instuction Citical Paths q Calculate cycle time assuming negligible delays (fo muxes, contol
Chapter 4 (Part III) The Processor: Datapath and Control (Pipeline Hazards)
Chapte 4 (Pat III) The Pocesso: Datapath and Contol (Pipeline Hazads) 陳瑞奇 (J.C. Chen) 亞洲大學資訊工程學系 Adapted fom class notes by Pof. M.J. Iwin, PSU and Pof. D. Patteson, UCB 1 吃感冒藥副作用怎麼辦? http://big5.sznews.com/health/images/attachement/jpg/site3/20120319/001558d90b3310d0c1683e.jpg
DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson
DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:
Detection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
University of Waterloo CS240 Winter 2018 Assignment 4 Due Date: Wednesday, Mar. 14th, at 5pm
Univesit of Wateloo CS Winte Assinment Due Date: Wednesda, Ma. th, at pm vesion: -- : Please ead the uidelines on sumissions: http://.student.cs.uateloo.ca/ ~cs//uidelines.pdf. This assinment contains
Dynamic Processor Scheduling with Client Resources for Fast Multi-resolution WWW Image Browsing
Dynamic Pocesso Scheduling with Resouces fo Fast Multi-esolution WWW Image Bowsing Daniel Andesen, Tao Yang, David Watson, and Athanassios Poulakidas Depatment of Compute Science Univesity of Califonia
Computer Architecture. Pipelining and Instruction Level Parallelism An Introduction. Outline of This Lecture
Compute Achitectue Pipelining and nstuction Level Paallelism An ntoduction Adapted fom COD2e by Hennessy & Patteson Slide 1 Outline of This Lectue ntoduction to the Concept of Pipelined Pocesso Pipelined
The Internet Ecosystem and Evolution
The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee
CS 2461: Computer Architecture 1 Program performance and High Performance Processors
Couse Objectives: Whee ae we. CS 2461: Pogam pefomance and High Pefomance Pocessos Instucto: Pof. Bhagi Naahai Bits&bytes: Logic devices HW building blocks Pocesso: ISA, datapath Using building blocks
EE 6900: Interconnection Networks for HPC Systems Fall 2016
EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection
IBM Optim Query Tuning Offerings Optimize Performance and Cut Costs
IBM Optim Quey Tuning Offeings Optimize Pefomance and Cut Costs Saghi Amisoleymani Solution Achitect Integated Data Management amisole@us.ibm.com June 9, 2010 Disclaime Copyight IBM Copoation [cuent yea].
Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes
On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation
Two-Dimensional Coding for Advanced Recording
Two-Dimensional Coding fo Advanced Recoding N. Singla, J. A. O Sullivan, Y. Wu, and R. S. Indec Washington Univesity Saint Louis, Missoui s Motivation: Aeal Density Pefomance: match medium, senso, pocessing
Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
Configuring RSVP-ATM QoS Interworking
Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP
GCC-AVR Inline Assembler Cookbook Version 1.2
GCC-AVR Inline Assemble Cookbook Vesion 1.2 About this Document The GNU C compile fo Atmel AVR isk pocessos offes, to embed assembly language code into C pogams. This cool featue may be used fo manually
Prioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
Exploring non-typical memcache architectures for decreased latency and distributed network usage.
Syacuse Univesity SURFACE Electical Engineeing and Compute Science Technical Repots College of Engineeing and Compute Science 9-5-20 Exploing non-typical memcache achitectues fo deceased latency and distibuted
OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO
OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal
i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA
i-pcgrid Wokshop 2016 Apil 1 st 2016 San Fancisco, CA Liang Min* Eddy Banks, Bian Kelley, Met Kokali, Yining Qin, Steve Smith, Philip Top, and Caol Woodwad *min2@llnl.gov, 925-422-1187 LDRD 13-ERD-043
CENG 3420 Lecture 07: Pipeline
CENG 3420 Lectue 07: Pipeline Bei Yu byu@cse.cuhk.edu.hk CENG3420 L07.1 Sping 2017 Outline q Review: Flip-Flop Contol Signals q Pipeline Motivations q Pipeline Hazads q Exceptions CENG3420 L07.2 Sping
High performance CUDA based CNN image processor
High pefomance UDA based NN image pocesso GEORGE VALENTIN STOIA, RADU DOGARU, ELENA RISTINA STOIA Depatment of Applied Electonics and Infomation Engineeing Univesity Politehnica of Buchaest -3, Iuliu Maniu
RBAC Tutorial. Brad Spengler Open Source Security, Inc. Locaweb
RBAC Tutoial Bad Spengle Open Souce Secuity, Inc. Locaweb - 2012 Oveview Why Access Contol? Goals Achitectue Implementation Lookup example Subject example Questions/Requests Why Access Contol? Access Contol
CISC 662 Graduate Computer Architecture Lecture 6 - Hazards
CISC 662 Gaduate Compute Achitectue Lectue 6 - Hazads Michela Taufe http://www.cis.udel.edu/~taufe/teaching/cis662f07 Powepoint Lectue Notes fom John Hennessy and David Patteson s: Compute Achitectue,
NODAL AND LOOP ANALYSIS TECHNIQUES
NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways
t [ Background removed
HANDS-ON > HOE1 Taining 1 Pictues You decide to ceate a memoies slide show fo you siste and he husband, who wee ecently maied. You include thei high school Sweetheat Ball image, engagement and wedding
SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
Conversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
Review: Moore s Law. EECS 252 Graduate Computer Architecture Lecture 2. Review: Joy s Law in ManyCore world. Bell s Law new class per decade
EECS 252 Gaduate Compute Achitectue Lectue 2 ℵ 0 Review of Instuction Sets, Pipelines, and Caches Januay 26 th, 2009 Review Mooe s Law John Kubiatowicz Electical Engineeing and Compute Sciences Univesity
Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing
IEEE TRANSACTIONS ON COMPUTERS, VOL. 50, NO. 9, SEPTEMBER 200 949 Dynamic Multiple Paity (DMP) Disk Aay fo Seial Tansaction Pocessing K.H. Yeung, Membe, IEEE, and T.S. Yum, Senio Membe, IEEE AbstactÐThe
Hierarchically Clustered P2P Streaming System
Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.
Lecture 27: Voronoi Diagrams
We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the
CMCS Mohamed Younis CMCS 611, Advanced Computer Architecture 1
CMCS 611-101 Advanced Compute Achitectue Lectue 6 Intoduction to Pipelining Septembe 23, 2009 www.csee.umbc.edu/~younis/cmsc611/cmsc611.htm Mohamed Younis CMCS 611, Advanced Compute Achitectue 1 Pevious
You Are Here! Review: Hazards. Agenda. Agenda. Review: Load / Branch Delay Slots 7/28/2011
CS 61C: Geat Ideas in Compute Achitectue (Machine Stuctues) Instuction Level Paallelism: Multiple Instuction Issue Guest Lectue: Justin Hsia Softwae Paallel Requests Assigned to compute e.g., Seach Katz
An Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network
An Efficient andove Mechanism Using the Geneal Switch Management Potocol on a Multi-Potocol abel Switching Netwok Seong Gon hoi, yun Joo Kang, and Jun Kyun hoi Using the geneal switch management potocol
RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver
1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent
Topological Characteristic of Wireless Network
Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences
Realistic Memories and. 2-level Data Cache Interface (0,n)
Realistic Meoies and Caches Pat III Li-Shiuan Peh Copute Science & Atificial Intelligence Lab. Massachusetts Institute of Technology Apil 4, 2012 http://csg.csail.it.edu/6.s078 L15-1 2-level Data Cache
Performing real-time image processing on distributed computer systems
Pefoming eal-time image pocessing on distibuted compute systems RADU DOBRESCU, MATEI DOBRESCU, DAN POPESCU "Politehnica" Univesity of Buchaest, Faculty of Contol and Computes, 313 Splaiul Independentei,
Access Control Mechanisms for Inter-organizational Workflow
Access Contol Mechanisms fo Inte-oganizational Wokflo Myong H. Kang, Joon S. Pak and Judith N. Fosche Naval Reseach Laboatoy Infomation Technology Division 4555 Ovelook Ave. Washington, DC 20375 {mkang,
Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs
Fault-Toleant Routing Schemes in RDT(,,)/α-Based Inteconnection Netwok fo Netwoks-on-Chip Designs Mei Yang, Tao Li, Yingtao Jiang, and Yulu Yang Dept. of Electical & Compute Engineeing Univesity of Nevada,
5 4 THE BERNOULLI EQUATION
185 CHATER 5 the suounding ai). The fictional wok tem w fiction is often expessed as e loss to epesent the loss (convesion) of mechanical into themal. Fo the idealied case of fictionless motion, the last
Communication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
Embeddings into Crossed Cubes
Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability
Controlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
DYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
Color Interpolation for Single CCD Color Camera
Colo Intepolation fo Single CCD Colo Camea Yi-Ming Wu, Chiou-Shann Fuh, and Jui-Pin Hsu Depatment of Compute Science and Infomation Engineeing, National Taian Univesit, Taipei, Taian Email: 88036@csie.ntu.edu.t;
THE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
Shortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
arxiv: v1 [cs.lo] 3 Dec 2018
![arxiv: v1 [cs.lo] 3 Dec 2018](/thumbs/91/107076588.jpg "arxiv: v1 [cs.lo] 3 Dec 2018")
A high-level opeational semantics fo hadwae weak memoy models axiv:1812.00996v1 [cs.lo] 3 Dec 2018 Abstact Robet J. Colvin School of Electical Engineeing and Infomation Technology The Univesity of Queensland
Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples
Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits
Class 21. N -body Techniques, Part 4
Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.
In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
In ode to lean which questions have been answeed coectly: 1. Pint these pages. 2. Answe the questions. 3. Send this assessment with the answes via: a. FAX to (212) 967-3498. O b. Mail the answes to the
Modeling a shared medium access node with QoS distinction
Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:
Monte Carlo Techniques for Rendering
Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety
# $!$ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved
A note on the use of these ppt slides: We e making these slides feely available to all (faculty, students, eades). They e in PowePoint fom so you can add, modify, and delete slides (including this one)
Positioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics
TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still
CSE4201. Computer Architecture
CSE 4201 Compute Achitectue Pof. Mokhta Aboelaze Pats of these slides ae taken fom Notes by Pof. David Patteson at UCB Outline MIPS and instuction set Simple pipeline in MIPS Stuctual and data hazads Fowading
A New Finite Word-length Optimization Method Design for LDPC Decoder
A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology
ART GALLERIES WITH INTERIOR WALLS. March 1998
ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall
a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
The Dual Round Robin Matching Switch with Exhaustive Service
The Dual Round Robin Matching Switch with Exhaustive Sevice Yihan Li, Shivenda S. Panwa, H. Jonathan Chao Abstact Vitual Output Queuing is widely used by fixed-length highspeed switches to ovecome head-of-line