PPT-Data-Centric Reconfiguration with Network-Attached Disks

Alex Shraer Technion Joint work with JP Martin D Malkhi M K Aguilera MSR I Keidar Technion Preview 2 The setting datacentric replicated storage Simple networkattached storagenodes . D. Reininger. ECE 544 . Spring 2014. Introduction. Apart from routing protocols that use a direct identifier of nodes, networking can take place based directly on content.. Content can be collected from the network, processed in the network, and stored in the network. . ARCHITECTURE. 1. Agenda. Introduction. Partial Reconfiguration Basics. Design Considerations. Advantages of Partial Reconfiguration. Challenges of Partial Reconfiguration. Application Examples. RAID (Redundant Arrays of Independent Disks). Disk . organization technique that manages a large number of disks, providing a view of a single disk of. High capacity and high speed up using multiple disk in parallel. Reducing . the size of the FPGA device required to implement a given function, . with consequent . reductions in cost and power consumption. Providing . flexibility in the choices of algorithms or protocols available to . Alex . Shraer. (. Technion. ). Joint work with: . J.P. Martin, D. Malkhi, M. K. Aguilera (MSR) . I. . Keidar. (. Technion. ). Preview. 2. The setting: . data-centric. replicated storage. Simple network-attached storage-nodes . Wensheng. Zhang and . Guohong. . Cao. Dynamic Convoy Tree-based Collaboration (DCTC). Constructing the Initial Convoy Tree. Apply existing root election algorithm. Other node connect to a neighbor closest to the root. Ethan Taylor. Dept. of Administration and Finance. Coordinator of Budgets and Grants. What is The difference in a “school” and a “program”?. When does the . sde. need to know about changes for the upcoming year?. Rohit Kumar. Dr. Ann Gordon-Ross. {. kumar. , . ann. }@. chrec.org. Dept. of Electrical and Computer Engineering. University of Florida. Gainesville, FL 32608 USA. RAW’15. Hyderabad, India . May 25, 2015. and RAID. Outline. Disks. Disk scheduling algorithms. Redundancy in storage . systems, RAID. 2. Disk Geometry. Disks have multiple platters. Each platter has . an arm and a head for accessing data. The arms for the different platters move together. Chris Morales. Kaz . Onishi. 1. Wireless Sensor Networks. Expected to be :. Autonomous. Low Power. Context aware. Flexible. Can have thousands of nodes spread out. Makes development and support complicated. Hao. Zhou∗, Xinyu Niu†, . Junqi. Yuan∗, . Lingli. Wang∗, Wayne . Luk. † . †Dept. of Computing, Imperial College London, UK . ∗School of Microelectronics, . Fudan. University, China . Jia Zhang, Roy Shi, Qihao Bao, Weiyi Wang, Shenggu Lu, Yuanchen Bai, Xingyu Chen, Haoyun Wen, Zhenyu Yang. Carnegie Mellon University – Silicon Valley. Rahul Ramachandran, Patrick N. Gatlin. NASA/MSFC. Reads and writes are equally fast.. Arrays of these disks are used to provide highly reliable storage.. Increasingly popular as they are fast and do not contain moving parts.. Magnetic Disks.. . What is a magnetic disk and how it works. draft-km-industrial-internet-requirements-00. K. Makhijani,.  . L. Dong. IETF 111 (IOTOPS - ). Discussion Points. State of Industry Control Networks – Reference Model. Scenarios & Challenges from emerging trends.