-
Solutions & Products
- Solutions & Products
-
Cloud Services
Cloud Services
Take the wheel with NetApp’s Cloud Services to simplify your cloud management landscape.
Visit Cloud ServicesSolutionsProducts -
Hybrid Cloud
Hybrid Cloud
Build your business on the best of cloud and on premises together with Hybrid Cloud Infrastructure solutions.
Visit Hybrid Cloud -
Data Storage
Data Storage
NetApp is the proven leader when it comes to modernizing and simplifying your storage environment.
Visit Data StorageSolutionsProducts -
Data Protection
Data Protection
Our industry-leading solutions are built so you can protect and secure your sensitive company data.
Visit Data ProtectionSolutions -
Data Management
Data Management
Get complete control over your data with simplicity, efficiency, and flexibility.
Visit Data ManagementProducts -
Enterprise Applications
Enterprise Applications
Speed application development, improve software quality, reduce business risk, and shrink costs.
Visit Enterprise Applications -
DevOps
Devops
Our solutions remove friction to help maximize developer productivity, reduce time to market, and improve customer satisfaction.
Visit DevopsSolutions -
AI
AI
NetApp AI solutions remove bottlenecks at the edge, core, and the cloud to enable more efficient data collection.
Visit AISolutionsProducts -
VDI
VDI
Provide a powerful, consistent end-user computer (EUC) experience—regardless of team size, location, complexity.
Visit VDIProductsQuick Links -
Services
Services
We have a service for your every need, plus the ones you’re about to discover.
Visit ServicesServicesQuick Links
- Support & Training
- How to Buy
- Community
Smruti Sarangi, IIT Delhi - Jan 2013
Date
January 01, 2013
Author
Smruti Sarangi
Lock free algorithms for scheduling in storage systems
Professor Sarangi will be examining construction of wait free multiple concurrent streams to address the scalability and QoS guarantees in modern storage systems. In the emerging world of SCM / In-memory and multi-cores, the existing lock mechanisms and programming paradigms are being challenged and STM too finds resonance. Wait-freedom has been chased for a number of years, but of late practical designs have started to emerge, which achieve system goals without bringing a system to snails-pace. Prof. Sarangi’s work focuses on an important computational aspect in storage based algorithms – scheduling and propose wait free parallel algorithms and evaluate them.