会议信息

SIGMETRICS 2027: International Conference on Measurement and Modeling of Computer Systems

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
SIGMETRICS
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2027-01-11 还有 113 天
通知日期:
2027-03-10
会议日期:
2027-06-07
会议地点:
Atlanta, Georgia, USA
届数:
CCF: B   ICORE: A*   QUALIS: A1   浏览: 760256   关注: 174   参加: 16

会伴指数 (CP-I)

96.5 / 100
全站第 6 名 / 共 5,682 个会议 · 前 1%

电气与电子工程 第 1 / 509 系统与体系结构 第 1 / 341

学术认可 (35%)
100
投稿选择性 (20%)
95
会议传承 (20%)
100
社区关注 (10%)
75
资料公开度 (15%)
100

用到的输入: 收录等级：CCF B, QUALIS A1 · 录用率：16.2%（有记录的 5 届的均值） · 有据可查的届次：53 · 在会伴关注它的研究者：174 人 · 过去 24 个月打开过本页的研究者：27 人

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-20

征稿

SIGMETRICS 2027 (International Conference on Measurement and Modeling of Computer Systems) is a CCF B / ICORE A* / QUALIS A1 conference held in Atlanta, Georgia, USA on 2027-06-07. The paper submission deadline is 2027-01-11. Acceptance notifications are sent on 2027-03-10.

Overview The 2027 ACM SIGMETRICS conference will be held as part of the ACM Federated Computing Research Conference (FCRC) in Atlanta, GA, June 7-11, 2027. We solicit papers on the design, modeling, measurement, and performance analysis of computer systems. A good submission typically focuses on a well-motivated problem in computer systems, proposes a principled solution using modeling, measurement, and performance analysis, and empirically validates the solution through simulations and/or implementation. The research may target systems in a broad range of domains, including networking, high-performance computing, machine learning, IoT, cloud, edge, multimedia, mobile, quantum computing/communication, and cyber-physical systems. The work may target diverse system metrics such as latency, throughput, reliability, cost, accuracy, fairness, energy, and carbon footprint. The conference presents papers that have been accepted to appear in the Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS). There are multiple deadlines to submit your work in time for a presentation at the conference (see below). A panel of reviewers will consider all accepted and eligible papers for the Best Paper Award and the Stephen S. Lavenberg and Kenneth C. Sevcik Outstanding Student Paper Award. Additionally, a selection of the accepted papers, as identified by a panel of reviewers, may be nominated for publication as Research Highlights in the Communications of the ACM (CACM). Topics We solicit papers describing original and previously unpublished research. Specific topics of interest include, but are not limited to, the following. Machine Learning and AI Machine learning and AI: Theory Machine learning and AI: Empirical studies and applications Machine learning for systems Systems for machine learning Measurement & Applied Modeling Anomaly detection, problem diagnosis, and troubleshooting System measurement, performance monitoring, and forecasting Experimental design, statistical analysis, simulation Workload characterization and benchmarking Systems Computer and communication networks: protocols and algorithms Computer architecture, hardware accelerators, multi-core processors, memory systems and storage networks Cloud computing, fog, and edge computing systems Energy-efficient and carbon-aware computing systems Mobile and personal computing systems Operating systems, file systems, and databases Real-time and fault-tolerant systems Security and privacy of computing and networked systems Software systems and services, and enterprise applications Wireless, mobile, ad-hoc and sensor networks, IoT applications Theory Analytical modeling techniques and model validation Capacity planning, resource allocation, and scheduling Control theory Game theory, network economics, and platform design Graph algorithms and analysis Queueing theory and applications Emerging Topics and Application Areas Blockchain and cryptocurrency Cyber-physical systems, including smart grids High-performance computing Quantum computing and communication Reproducibility and replicability (tools and methodology) Social networks, multimedia systems, Web services Sustainability and power management
由 Admin Agent 最后更新于

录用率

平均录用率: 16.5% 31 年间 (1989–2021).

年份提交数录用数录用率(%)
2021841416.7%
20202864415.4%
20193175015.8%
20182705420%
20172032713.3%
20162082813.5%
20152393213.4%
20142374016.9%
20131962613.3%
20122033115.3%
20111772916.4%
20101842915.8%
20091802715%
20082013617.9%
20071702917.1%
20062173013.8%
20052373113.1%
20042653312.5%
20032222611.7%
20021702313.5%
20012333012.9%
20001652817%
1999921819.6%
19981362518.4%
19971302519.2%
19961102421.8%
19951232722%
19941102522.7%
19921082018.5%
19901022322.5%
19891362216.2%

最佳论文

年份最佳论文
2026Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
2025Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
2024Agents of Autonomy: A Systematic Study of Robotics on Modern Hardware
2024Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
2023Mean-field Analysis for Load Balancing on Spatial Graphs
2022WISEFUSE: Workload Characterization and DAG Transformation for Serverless Workflows
2021Nudge: Stochastically Improving upon FCFS
2020Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
2019Computationally Efficient Estimation of the Spectral Gap of a Markov Chain
2018Asymptotically Optimal Load Balancing Topologies
2018A Refined Mean Field Approximation
2017Security Game with Non-additive Utilities and Multiple Attacker Resources
2017Accelerating Performance Inference over Closed Systems by Asymptotic Methods
2016The Value of Privacy: Strategic Data Subjects, Incentive Mechanisms and Fundamental Limits
2016On the Duration and Intensity of Competitions in Nonlinear Pólya Urn Processes with Fitness
2015Spy vs. Spy: Rumor Source Obfuscation
2014Concave switching in single and multihop networks
2013Queueing System Topologies with Limited Flexibility
2012Temperature management in data centers: why some (might) like it hot
2011Topology Discovery of Sparse Random Graphs With Few Participants
2010Load balancing via random local search in closed and open systems
2009The Age of Gossip: Spatial Mean Field Regime
2008Counter Braids: A Novel Counter Architecture for Per-Flow Measurement
2007Modeling the Relative Fitness of Storage
2006Maximizing throughput in wireless networks via gossiping
2005Coupon replication systems
2004On performance bounds for the integration of elastic and adaptive streaming flows
1996Exploiting process lifetime distributions for dynamic load balancing
1996Supporting stored video: Reducing rate variability and end-to-end resource requirements through optimal smoothing

看过这个的人也在看

相关会议

相关期刊

CCF全称影响因子出版商ISSN
BJournal of Parallel and Distributed Computing3.4Elsevier0743-7315
Measurement5.2Elsevier0263-2241
Measurement: SensorsElsevier2665-9174
Measurement and Control1.300SAGE0020-2940
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048

评论 0

暂无评论。

请登录后发表评论