We covered a lot of ground in out recent SNIA Ethernet Storage Forum webcast, “.” We had a technical discussion on why containers are so compelling, how Docker containers work, persistent shared storage and future considerations for container storage. We received some great questions during the live event, and as promised, here are answers to them all. Docker cannot be installed on bare metal and requires a base OS to operate upon right?
Iso Fits And Tolerances
That is correct. Does the application code need to be changed so that it can “fit and operate” in a container? No, the application code does not need to change. The challenge most people face when migrating an application to a container is how to maintain the application’s state. One of the motivations for this webcast was to explain how to allow applications within containers to persist data.
Hopefully the Docker Volume construct will meet your needs. Seems like containers share one OS/kernel That suggests that there is just one OS in the “containerized” server And yet there is still mention of hypervisor (or at least Hyper-V) Can you clarify? If the containers share an OS, is a hypervisor needed? You are correct, containers are designed to share a single kernel; therefore a hypervisor is not required to run containers. Having said that, VMware and Microsoft both offer options that run a single container in its own virtual machine (running a minimal operating system). Can the Docker Hub be compared to something like the GitHub? Yes, that is a great analogy.
Docker Hub (hub.docker.com) is to container images as GitHub (github.com) is to source code. What are the differences between the base and the host image? If you’re referring to the; the box labeled “Base Image” is the first layer in an image. The box labeled “Host OS” is not a layer, but represents the hosting operating system (kernel) that is shared by the containers.
So there is a separate root per container? In most cases the image will provide a root, therefore each container will have a separate root. This is made possible by a kernel feature called namespaces. Alternatively, Docker does allow you to share a directory between the host operating system and any number of containers though.
If Deduplication is enabled on the storage LUNs, won’t that affect the performance of the containers? Well implemented data reduction features (compression and deduplication) should have little to no effect on performance and should provide significant benefit by reducing the space required to store containers. Can you please quickly review the concept of copy-on-write with one or two sentences to boil it down? How the copy-on-write works depends on whether the driver is file or block based. For the sake of simplicity, let’s assume a file-based implementation.
Since the image layers are read-only, we need an area to store the changes that the container has made. This area is the copy-on-write layer.
When a process reads a file that has not been modified, the file is read from one of the read only layers. When that file is modified and needs to be written back to disk, the new file is written to the copy-on-write layer as is the metadata that describes the file. The next time this file is read, it is read from copy-on-write layer. The graph driver is responsible for this functionality and varies by implementation.
Can network locations be used for /data? If yes, how does the Docker Engine manage network authentication for the driver? Yes, network locations can be used. The best practice is to use the Local Volume Driver, where you can pass in the required authentication via the options. Alternatively, the network location can be mounted on the host operating system and exposed to containers. Is this where VAAI like primitives would get implemented? VAAI defines several in-band primitives.
The Docker Volume plug-in framework is completely out-of-band. There can be some overlap in features though. For example, the XCOPY primitive can be used to offload ‘copy jobs’ to an array. If the vendor chooses to do so, a ‘copy job’ can be offloaded through the Docker Volume plug-in as well. For example, a plug-in might implement a “clone” option that provides this service. Could you share some details about Kubernetes storage?
Persistent volumes and the difference from Docker volumes? Also, what is your perspective of Flocker?
Kubernetes has the concept of persistent storage. This abstraction is also called a volume. In addition, Kubernetes provides a plug-in option as well.
The Kubernetes implementation predates the Docker Volume and is currently not compatible. Comment on mainframe: IBM runs Linux on zSeries, therefore can run Linux Docker containers. Thanks, that’s good to know. How many operating systems changes on the x86 platform?
How many on the mainframe platform? Can x86 architecture run the same code/OS from 40 years ago?
Docker on mainframe? The mainframe architecture has been very solid and consistent for many years. What is a big challenge for storage in container environment? I don’t think storage has a challenge in the container environment.
I think, with a properly implemented Docker Volume Plug-in, storage provides a solution to the persistent shared storage need in a container environment. Do you ever look into RexRay or VMDK storage drivers? Yes, these are both examples of Docker Volume plug-in implementations.
Comments Off on No Shortage of Container Storage Questions Posted by Chad Hintz. SNIA Cloud is hosting a live webcast on December 20th, “,” to discuss and demonstrate encrypted objects and delegated access control. For the data protection needs of sharing health and other data across different cloud services, this webcast will explore the capabilities of the Cloud Data Management Interface (CDMI) in addressing these requirements and show implementations of CDMI extensions for a health care example. See it in action! This webcast will include a demonstration by Peter van Liesdonk of Philips who will share the results of testing at the SDC 2016 Cloud Plugfest for Encrypted Objects and Delegated Access Control extensions to CDMI 1.1.1. You’ll will see and learn:. New CDMI features (Encrypted Objects and Delegated Access Control).
Implementation experiences with new features. A live demo of a healthcare-based example. My colleagues, Peter van Liesdonk, David Slik and I will be on-hand to answer any questions you may have. We hope to see you there. Comments Off on Learn How to Develop Interoperable Cloud Encryption and Access Control Posted by mac. More than 350 people have already seen our SNIA Ethernet Storage Forum (ESF) webcast “.” Our presenters, James Coomer and Jerry Lotto, did a great job explaining what clustered file systems are, key considerations, choices and performance. As we expected, there were plenty of questions, so as promised, here are answers to them all.
Q: Parallel NFS (pNFS) has been in development/standard effort for a long time, and I believe pNFS is not in the Linux kernel it appears pNFS is yet to be prime time. A: pNFS has been in Linux for over a decade! Clients and server are widely available, and you should look at the SNIA White Paper “” for more information on the current state of play. Q: Why the emphasis on parallel I/O? Any single storage server can feed results at link capacity, so you do not need multiple storage servers to feed a client at full speed.
Isn’t the more critical issue the bottleneck on access to metadata for a single directory or file? Federated NAS bottlenecks updates for each directory behind a single master server? A: Any one storage server can usually saturate one client, but often there are multiple hungry clients making requests simultaneously. Using parallel I/O allows multiple servers to feed multiple high-bandwidth clients across a narrow or wide set of data.
This smooths out the I/O load on the servers in a near-perfect manner regardless of the number of clients performing I/O. It is absolutely true that metadata serving can become a bottleneck, so parallel file systems use cached and/or distributed metadata to overcome this and again, every client takes part in that interaction and shares some responsibility for managing communicating metadata updates. Q: Can any application access parallel file system (i.e. Through an agent in the driver level)? Or does it require specific code within the application? A: Native access to a parallel file system requires a specific client or agent in the host, but many parallel file systems allow any client to access the data through a NAS protocol gateway.
No changes are needed to applications to use a parallel file system – These parallel file systems are mounted as a POSIX compliant file system and therefore adhere to basically the same standards as an NFS mount for example. Q: Are parallel file system clients compatible with scale-out NAS servers? A: Nearly all scale-out NAS servers speak a standard NAS protocol like NFS or SMB. Clients running a parallel file system client can also access NAS via these standard protocols. Exceptions to this may possibly (but none that we know of) occur for scale-out NAS servers that support a modified NFS/SMB protocol or a custom NAS client which might conceivably conflict with the parallel file system client when installed on an OS. Q: Of course I am biased, but I am fond of the AFS (Andrew File System) Family of File Systems.
There is OpenAFS, but there is also what we are doing at AuriStor extending beyond the core AFS global namespace model (security functionality, and performance) A: AFS is another distributed file system which supports large scale deployments, native clients for many platforms, and strong security features. It also uses local caching of files to improve performance.
It uses a weakly consistent file locking system so multiple clients can access the same file simultaneously but they cannot both update the same file at the same time. OpenAFS is an open-source implementation of AFS. Auristor (formerly Your File System, Inc.) is a startup providing a commercial parallel file system that is compatible with AFS. Q: I am more familiar with Veritas Cluster File System, could you please do a quick compare with Lustre or GPFS? A: The Veritas Cluster File System (formerly VxCFS, now part of Veritas InfoScale) is a distributed file system that runs on Linux and popular flavors of Unix.
It supports up to 64 nodes and allows multiple nodes to share the same back-end storage hardware. Comparing it to Lustre and GPFS is beyond the scope of this webinar, but in basic terms, parallel file systems can offer far greater scalability and bandwidth for example, through the use of optimized RDMA clients for high performance networks. Q: Why do file apps need shared access to data, but block apps do not? A: Traditionally block storage did not offer shared access to data (except when used as shared back-end storage for a clustered file system), while apps that needed shared access to data usually chose to use a NAS protocol such as SMB or NFS. So in many cases file-based apps use file sharing protocols because they need shared access to data from multiple clients.
(In other cases file-based applications do not require sharing but the storage administrators believe it’s easier to manage or less expensive than networked block storage.) Q: Do Lustre and GPFS have SMB Direct support? A: Not today.
SMB Direct is an option to use RDMA and multi-channel with the SMB 3 protocol. Both Lustre and GPFS support the ability to export a file system via NFS or SMB, but generally they do not support SMB Direct yet. Both Lustre and GPFS support RDMA access through their clients. How to the clients avoid doing simultaneous writes to the same file?
A: Some parallel file systems allow this by letting different clients write to different parts of the same file. Others do not allow this. In either case, distributed file locking is used to prevent two clients from writing simultaneously to the same part of a file (or to the same file if it’s not allowed). Q: How can you say that the application “does not have to worry about” how the clustered file system serializes writes?
Doesn’t this require continuous end-to-end connectivity? A: When the application writes data it generally writes to a POSIX-compliant file system and does not need to worry about how the parallel file system serializes, distributes, or protects the data because this is virtualized (managed) by the file system. It usually does require continuous end-to-end connectivity from the clients to the servers, though in some cases caching could allow for brief gaps in connectivity and in some systems not every client needs to have network connectivity to every server. There are multiple mechanisms within parallel file systems to manage the various cases of clients/servers disappearing from the network, temporarily or permanently (whilst for example holding a lock). Q: How does a parallel file system handle the sequences of write on a same file?
Just append one by one? What if a client modified a line? A: This is the biggest challenge for and reason to use a parallel file system.
Beneath the covers, coherency is maintained by Spectrum Scale using a token management server process which issues locks for object requests. Similar functionality is implemented in Lustre using a distributed lock manager. These objects are most commonly blocks within files rather than entire files, but this is application controlled.
The end result is a POSIX-compliant interface that scales to thousands of clients. Q: What does FPO stand for? A: File Placement Optimizer – a shared-nothing architecture and licensing model for IBM Spectrum Scale (aka GPFS). Q: Is there a concept in parallel file systems for “auto-tuning” yet?
Seems like the early days of SAN management and tuning A: Default tuning values are optimized for general purpose workloads, but the whole purpose of tuning parameters is to adjust away from those defaults to optimize the file system for a particular application workload or fil esystem architecture. Both IBM and OpenSFS with the support of Intel have published extensive documentation on best practices for optimization and tuning for either file system. We are not aware of any work on “automating” that process but there has been recent work (e.g. In spectrum scale) to simplify the tuning process. Q: Which is better as interconnect between disk and servers, shared access or share-nothing? A: The use of shared access in the interconnect between disks and servers is limited to providing HA functionality in Lustre or Spectrum Scale, the ability to service I/O requests to a storage device if the server which has primary responsibility for that device is not available. This usually involves multiple server-attached external storage which can add cost to building the file system.
The alternative approach to HA is to replicate blocks of data to different disks on different servers, cutting back on the usable capacity of the file system. If HA is not a requirement, a share-nothing architecture will generally involve less hardware and therefore be less expensive to build.
If you have more questions, please comment on this blog. And I encourage you to check out the for educational, vendor-neutral content on Ethernet networked storage topics Comments Off on Common Questions on Clustered File Systems Posted by John Kim.
Each year, at the Annual Members Symposium, SNIA members recognize their own – volunteers and organizations who have dedicated expertise and time to contribute to the important work done by SNIA technical work groups, committees, and initiatives. SNIA recognizes with a “Volunteer of the Year” award an individual contributor who has stepped up to help SNIA achieve new and groundbreaking work or significantly advanced an existing program. Past winners have included Mark Carlson of Toshiba, Jim Ryan of Intel, and Alex McDonald of NetApp. With the Exceptional Leadership award, SNIA recognizes an individual who has advanced a cause for SNIA leading to an impact on the industry or the Association. Past winners have included Wayne Adams of EMC, Eric Hibbard of Hitachi, and Paul von Behren of Intel. SNIA also recognizes unsung heroes who work tirelessly under the radar expecting no attention but who in fact probably deserve more than the rest, and new contributors of the year who begin work in new areas.
SNIA also recognizes groups with several awards, including outstanding achievement of a SNIA Technology Community, significant contribution by a SNIA Committee or Regional Affiliate, significant impact by a previously existing SNIA Technical Work Group or Task Force, and contributions by new SNIA groups. Previous recipients have been acknowledged for their work in Persistent Memory, Solid State Storage, Storage Management, and Object Drives, and with SNIA India and the SNIA Global Steering Committee. A list of all individuals and groups recognized since 2008 can be found.
Also at the Annual Members Symposium, SNIA honors Deborah Kay Johnson, a SNIA member whose volunteer dedication to educating the industry on technology left a lasting impact, with the Deborah Kay Johnson Memorial Award. Past winners of this award for their outstanding contributions to education include Charles Tasse, Dell; Nancy Clay, SNIA; and David Deming, Solution Technology; all recipients are listed. It’s time for the 2016 awards, and SNIA encourages all members to enter their nominations for both individual and group categories. The window to submit is open until December 9 and your selections can be made at this. Awards will be announced during the SNIA Annual Members Symposium, January 17-20, 2017, at the Westin San Jose. Register to attend the Symposium and view the agenda. In the first of our “,” we covered the storage basics to break down the entire storage picture and identify the places where most of the confusion falls.
It was a very well attended event and I’m happy to report, everyone’s pride stayed intact! We got some great questions from the audience, so as promised, here are our answers to all of them: Q. What is parity? In RAID, there are generally two kinds of data that are stored: the actual data and the parity data. The actual data is obvious; parity data is information about the actual data that you can use to reconstruct it if something goes wrong. It’s important to note that this is not simply a copy of A and B, but rather a logical operation that is applied to the data.
Commonly for RAID (other than simple mirroring) the method used is called an exclusive or, or XOR for short. The XOR function outputs true only when inputs differ (one is true, the other is false). There’s a neat feature about XOR, and the reason it’s used by RAID. Calculate the value A XOR B (let’s call it AxB). Here’s an example on a pair of bytes.
A 10011100 B 01101100 A XOR B is AxB 11110000 Store all three values on separate disks. Now, if we lose A or B, we can use the fact that AxB XOR B is equal to A, and AxB XOR A is equal to B. For example, for A; B 01101100 AxB 11110000 A XOR AxB is A 10011100 We’ve regenerated the A we lost. (If we lose the parity bits, they can just be reconstructed from A and B.) Q. What is common notation for RAID?
I have seen RAID 4+1, and RAID (4,1). In the past, I thought this meant a total of 5 disks, but in your explanation it is only 4 disks. RAID is notated by levels, which is determined by the way in which data is laid out on disk drives (there are always at least two). When attempting to achieve fault tolerance, there is always a trade-off between performance and capacity. Such is life. There are 4 common RAID levels in use today (there are others, but these are the most common): RAID 0, RAID 1, RAID 5, and RAID 6.
As a quick reminder from the webinar (you can see pictures of these in action there):. RAID 0: Data is striped across the disks without any parity. Very fast, but very unsafe (if you lose one, you lose all). RAID 1: Data is mirrored between disks without any parity.
Slowest, but you have an exact copy of the data so there is no need to recalculate anything to reconstruct the data. RAID 5: Data is striped across multiple disks, and the parity is striped across multiple disks. Often seen as the best compromise: Fast writes and good safety net. Can withstand one disk loss without losing data. RAID 6: Data is striped across multiple disks, and two parity bits are stored on all the disks. Same advantages of RAID 5, except now you can lose 2 drives before data loss.
Now, if you have enough disks, it is possible to combine RAID levels. You can, for instance, have four drives that combine mirroring and striping. In this case, you can have two sets of drives that are mirrored to each other, and the data is striped to each of those sets. That would be RAID 1+0, or often called RAID 10. Likewise, you can have two sets of RAID 5 drives, and you could stripe or mirror to each of those sets, and it would be RAID 50 or RAID 51, respectively.
Erasure Coding has a different notation, however. It does not use levels like RAID; instead, EC identifies the number of data bits and the number of parity bits. So, with EC, you take a file or object and split it into ‘k’ blocks of equal size.
Then, you take those k blocks and generate n blocks of the same size, such that any k out of n blocks suffice to reconstruct the original file. This results in a (n,k) notation for EC. Since RAID is a subset of EC, RAID6 is the equivalent of EC or RAID(n,2) or n data disks and 2 parity disks. RAID(4,1) is RAID5 with 4 data and 1 parity, and so on. Which RAIDs are classified/referred to as EC? I have often heard people refer to RAID 5/6 as EC. Is this only limited to 5/6?
All RAID levels are types of EC. The math is slightly different; traditional RAID uses XOR, and EC uses Galois Fields or polynomial arithmetic. What’s the advantage of RAID5 over RAID1? As noted above, there is a tradeoff between the amount of capacity that you need in order to stay fault tolerant, and the performance you wish to have in any system. RAID 1 is a mirrored system, where you have a single block of data being written twice – one to each disk. World heroes openbor download. This is done in parallel, so it doesn’t take any extra time to do the write, but there’s no speed-up either.
One advantage, however, is that if a disk fails there is no need to perform any logical calculations to reconstruct data – you already have a copy of the intact data. RAID 5 is more distributed. That is, blocks of data are written to multiple disks simultaneously, along with a parity block. That is, you are breaking up the writing obligations across multiple disks, as well as sending parity data across multiple disks. This significantly speeds up the write process, but more importantly it also distributes the recovery capabilities as well so that any disk can fail without losing data.
So RAID improves WRITES? I guess because it breaks the data into smaller pieces that can be written in parallel. If this is true, then why will READ not benefit from RAID? Isn’t it that those pieces can be read and re-combined into a larger piece from parallel sources would be faster?
RAID and the “striping” of IO can improve writes by reducing serialization by allowing us to write anywhere. But a specific block can only be read from the disk it was written to, and if we’re already reading or writing to that disk and it’s busy – we must wait. Why is EC better for object stores than RAID? Because there’s more redundancy, EC can be made to operate across unreliable and less responsive links, and at potentially geographic scales.
Q: Can you explain about the “RAID Penalty?” I’ve heard it called “Write Penalty” or “Read before Write penalty.” A. When updating data that’s already been written to disk, there’s a requirement to recalculate the parity data used by RAID. For example, if we update a single byte in a block, we need to read all the blocks, recalculate the parity, and write back the updated data block and the parity block (twice in the case of dual parity RAID6). There are some techniques that can be used to improve the performance impact.
For example, some systems don’t update blocks in place, but use pointer-based systems and only write new blocks. This technique is used by flash-based SSDs as the write size is often 256KB or larger. This can be done in the drive itself, or by the RAID or storage system software. It is very important to avoid when using Erasure Coding as there are so many data blocks and parity blocks to recalculate and rewrite that it would become prohibitive to do an update. Q. What is the significance of RAIN? We have not heard much about it. A.A Redundant Array of Independent Nodes works under the same principles of RAID – that is, each node is treated as a failure domain that must be avoided as a Single Point of Failure (SPOF).Where as RAID maintains an understanding of data placement on individual drives within a node, RAIN maintains an understanding of data placement on nodes (that contain drives) within a storage environment.
Q. Is host same as node? A. At its core, a “node” is an endpoint. So, a host can be a node, but so can a storage device at the other end of the wire. Q. Does it really matter what Erasure Coding (EC) technologies are named or is EC just EC? Erasure Coding notation refers to the level of resilience involved. This notation underscores not only the write patterns for storage of data, but also the mechanisms necessary for recovery.
What ‘matters’ really will depend upon the level of involvement for those particular tasks. Is the Volume Manager concept related to Logical Unit Numbering (LUNs)? A. It can be. A volume manager is an abstraction layer that allows a host operating system to create a Volume out of one or more media locations. These locations can be either logical or physical.
A LUN is an aggregation of media on the target/storage side. You can use a Volume Manager to create a single, logical volume out of multiple LUNs, for instance. For additional information on this, you may want to watch our SNIA-ESF webcast, “.” Q. What’s the relationship between disk controller and volume manager?
Following on the last question, a disk controller does exactly what it sounds like – it controls disks. A RAID controller, likewise, controls disks and the read/write mechanisms. Some RAID controllers have additional software abstraction capabilities that can act as a volume manager as well. We hope these answers clear things up a bit more. As you know, our “Everything You Wanted To Know About Storage, But Were Too Proud To Ask” is a series, since this Chartreuse event, we’ve done “” where we explained channel vs.
Iso Fit Tolerance Chart
Bus, control plane vs. Data plane and fabric vs. Check it out and follow us on Twitter for announcements on upcoming webcasts.
Comments Off on Storage Basics Q&A and No One’s Pride was Hurt Posted by J Metz. It’s an easy “Yes” vote for this great webcast from the SNIA Solid State Storage Initiative on the Magic and Mystery of In-Memory Apps! Join us on Election Day – November 8 – at 1:00 pm ET/10:00 am PT to learn about today’s market and the disruptions that happen when combining big-data (Petabytes) with in-memory/real-time requirements. You’ll understand the interactions with Hadoop/Spark, Tachyon, SAP HANA, NoSQL, and the related infrastructure of DRAM, NAND, 3DXpoint, NV-DIMMs, and high-speed networking and learn what happens to infrastructure design and operations when “tiered-memory” replaces “tiered storage”. Presenter Shaun Walsh of G2M Communications is an expert in memory technology – and a great speaker! He’ll share with you what you need to know about evaluating, planning, and implementing in-memory computing applications, and give you the framework to evaluation and plan for your adoption of in-memory computing. Register at: Comments Off on Cast Your Vote on November 8 for the Magic and Mystery of In-Memory Apps!
Posted by Marty Foltyn. When SNIA’s Ethernet Storage Forum (ESF) last looked at the Ethernet Roadmap for Networked Storage in 2015, we anticipated a world of rapid change.