Conference Information

SOSP 2026: ACM Symposium on Operating Systems Principles

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Embed deadline badge
SOSP
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2026-03-26
Notification Date:
2026-07-03
Conference Date:
2026-09-29
Location:
Prague, Czech Republic
Years:
32
CCF: A   ICORE: A*   QUALIS: A1   Viewed: 1663881   Tracked: 122   Attend: 6

Conference Partner Index (CP-I)

92.4 / 100
Ranked #37 of 5,658 conferences · Top 1%

#11 of 340 in Systems & Architecture

Academic recognition (35%)
100
Submission selectivity (20%)
94
Editions held (20%)
100
Community attention (10%)
65
Public record completeness (15%)
80

Inputs used: Listed as CCF A, QUALIS A1 · Acceptance rate: 16.7% (mean of 5 editions on file) · Editions on record: 47 · Researchers following it here: 122 · Researchers who opened this page in the past 24 months: 11

Missing from the public record: Past editions (+3.0)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-10

Call For Papers

SOSP 2026 (ACM Symposium on Operating Systems Principles) is a CCF A / ICORE A* / QUALIS A1 conference held in Prague, Czech Republic on 2026-09-29. The paper submission deadline is 2026-03-26. Acceptance notifications are sent on 2026-07-03.

Topics SOSP takes a broad view of systems and solicits contributions from many fields of systems practice, including: operating systems, file and storage systems, distributed systems, cloud computing, mobile and edge systems, secure and reliable systems, systems aspects of big data and machine learning, embedded and real-time systems, virtualization, networking as it relates to operating systems, and management and troubleshooting of complex systems. We also welcome work that explores the interaction of computer systems with related areas such as computer architecture, networking, programming languages, analytics, verification, and databases. In keeping with SOSP tradition, we will favor work that explores new territory, continues a significant research dialogue, or reflects on experience with or measurements of state-of-the-art implementations. Submission Criteria Submissions will be judged on novelty, significance, interest, clarity, relevance, and correctness. A good paper will: Motivate a significant problem; Propose and implement an interesting, compelling solution; Demonstrate the practicality and benefits of the solution; Draw appropriate conclusions; Clearly describe the paper's contributions; and Clearly articulate the advances beyond previous work. We encourage submission of groundbreaking work in significant new directions, with the understanding that the evaluation criteria for papers addressing new problems may be different from those continuing a line of work in a more established area.
Last updated by Dou Sun on

Acceptance Ratio

Average acceptance rate: 18.9% over 9 years (1995–2011).

YearSubmittedAcceptedAccepted(%)
20111572817.8%
20091402316.4%
20071312519.1%
20051552012.9%
20031282217.2%
2001851720%
1999901921.1%
19971202319.2%
1995842226.2%

Best Papers

YearBest Papers
2025Rearchitecting the Thread Model of In-Memory Key-Value Stores with muTPS
2025CortenMM: Efficient Memory Management with Strong Correctness Guarantees
2025Atmosphere: Practical Verified Kernels with Rust and Verus
2025From Rust Till Run: Extending Memory Safety From Rust to Cryptographic Assembly
2023Validating JIT Compilers via Compilation Space Exploration
2023Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture
2023TreeSLS: A Whole-system Persistent Microkernel with Tree-structured State Checkpoint on NVM
2021Using Lightweight Formal Methods to Validate a Key-Value Storage Node in Amazon S3
2021LineFS: Efficient SmartNIC Offload of a Distributed File System with Pipeline Parallelism
2021Kangaroo: Caching Billions of Tiny Objects on Flash
2019Scaling symbolic evaluation for automated verification of systems code with Serval
2017DeepXplore: Automated Whitebox Testing of Deep Learning Systems
2017The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web
2015Pivot Tracing: Dynamic Causal Monitoring for Distributed Systems
2015Using Crash Hoare Logic for Certifying the FSCQ File System
2015Coz: Finding Code that Counts with Causal Profiling
2013Naiad: A Timely Dataflow System
2013Towards optimization-safe systems: analyzing the impact of undefined behavior
2013The Scalable Commutativity Rule: Designing Scalable Software for Multicore Processors
2011Cells: a virtual mobile smartphone architecture
2011A file is not a file: understanding the I/O behavior of Apple desktop applications
2009seL4: formal verification of an OS kernel
2009FAWN: a fast array of wimpy nodes
2009RouteBricks: exploiting parallelism to scale software routers
2007Sinfonia: a new paradigm for building scalable distributed systems
2007Zyzzyva: speculative byzantine fault tolerance
2007Secure web application via automatic partitioning
2005BAR Tolerance for Cooperative Services
2005Vigilante: End-to-End Containment of Internet Worms
2005Rx: treating bugs as allergies - a safe method to survive software failures
2005Speculative execution in a distributed file system
2003Preserving peer replicas by rate-limited sampled voting
2003Backtracking intrusions
2003Improving the reliability of commodity operating systems
2003Xen and the art of virtualization
2001Untrusted Hosts and Confidentiality: Secure Program Partitioning
2001BASE: Using Abstraction to Improve Fault Tolerance
1999The Click modular router
1999Cellular Disco: resource management using virtual clusters on shared-memory multiprocessors
1999Manageability, Availability and Performance in Porcupine: A Highly Scalable, Cluster-based Mail Service
1999Soft timers: efficient microsecond software timer support for network processing
1997DISCO: Running Commodity Operating Systems on Scalable Multiprocessors
1997Continuous Profiling: Where Have All the Cycles Gone?
1997Eraser: a dynamic data race detector for multithreaded programs
1979Weighted Voting for Replicated Data

Related Conferences

CCFICORECP-IShortFull NameSubmissionConference
AA*92.4SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-07-20
AA*97.7AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
AA*91.1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-06-03
AA*89.3STOCACM Symposium on Theory of Computing2025-11-042026-06-22
AA*95.2OSDIUSENIX Symposium on Operating Systems Design and Implementation2026-12-012027-07-07
AA*91.9ICMLInternational Conference on Machine Learning2026-01-232026-07-06
AA*97.2INFOCOMInternational Conference on Computer Communications2026-07-242027-05-24
AA*89.2ICCVInternational Conference on Computer Vision2025-03-072025-10-19
AA*94.1CHIACM Conference on Human Factors in Computing Systems2026-09-102027-05-10
AA89.0ISSTAInternational Symposium on Software Testing and Analysis2026-01-292026-10-03

Related Journals

Comments 0

No comments yet.

Please Login to post a comment