SCA2027 Call for Birds of a Feather (BoF) Proposals
We invite our fellow HPC community to submit Birds of a Feather (BoF) proposals to present, discuss, and brainstorm the latest advancements in supercomputing and adjunct topic areas.
The BoF sessions should be non-commercial and focus on community building through interactive presentations and discussions. Before submitting, consider whether your proposed session fits this description, and whether there is a sizable group of people curious about the topic. Proposals should demonstrate a clear concept for the interactive nature of their BoF.
We encourage submissions on a wide range of topics, including but not limited to:
- System Architecture & Hardware Components: Supercomputers, CPU/GPU Architectures, Heterogeneous and Disaggregated Architectures, Networks & Memory & Storage, Cloud Computing & Data Centers, Infrastructure & Cooling, Integration of Quantum Computing and HPC
- Programming Environments & System Software: Programming Frameworks & DSLs, Compilers & Tools, System Software, System Operation, Libraries, Runtimes, Parallel File Systems
- Algorithms, Methods & Performance: Novel Algorithms, Mixed or Low Precision, Performance Measurement, Modeling, and Tools, State of the Practice
- Applications & Use Cases: Scientific Applications, Data Analytics, Visualization & Storage, Industrial Use Cases of HPC, ML and QC, Visualization and Virtual Reality
- Machine Learning & AI: Artificial Intelligence & Machine Learning, HPC for Machine Learning and ML for HPC, Data Analytics & Visualization, Digital Twins
- Post-Moore Computing: Quantum Computing, Neuromorphic Computing, Optical Computing, Approximate Computing
- Community & HPC: Translation of HPC into Societal Context, Diversity and Inclusion, Education and Training, Meetings, and Others
| Submission Timeline
1st Round
Proposal Deadline: 30 November 2026
Notification of Acceptance: 14 December 2026
BoF Dates: 1 – 4 March 2027
2nd Round
| Proposal Format
1. Title:
Provide a concise and descriptive title for your BoF.
2. Abstract:
Include a summary (up to 100 words) that clearly outlines the short description of your proposed BoF.
3. Long Description (up to 1000 words), including:
List the session leader and all presenters, including:▪ Goal(s) and topic(s)
▪ Session format information (presentations, panels, interaction between audience, …)
▪ Relevance to the expected HPC audience of SCA
▪ Whether the BoF topic deals with commercial technology
▪ Expected audience
▪ Whether the BoF has been held before and past attendance count(s)
▪ The expected outcome, and/or
▪ Any special requirements or requests (e.g. preferred date and time).
4. Session Leader(s) and Presenter Information
▪ Full names
▪ Titles / designations
▪ Affiliations / companies / organizations
▪ Contact emails for session leader(s)
▪ Biography for session leader(s)
| BoF Facility
SCA 2027 will facilitate a 1-hour session for each accepted BoF.
The SCA organizers will provide meeting room facilities and basic technical equipment (e.g. projector and screen) for the BoF sessions.
| Fees and Registration
SCA 2027 attendees can participate in BoFs at no additional cost.
BoF leaders and presenters need to be registered as regular SCA participants. Travel, accommodation, registration fees and other such costs will not be covered by the SCA organizers.
| Proposal Submission
Please submit your proposal as a PDF file via the SCA 2027 submission site by the specified deadlines.
| Review of Submissions
Proposals will be reviewed based on relevance, clarity, originality, practical applicability, and the leader/presenters’ expertise.
Accepted BoFs will be notified by email, and further instructions will be provided at a later date.
| BoF Proposal Review Committee
More details on the BoF Proposal Review Committee will be shared at a later date.
| Contact
Please contact the Posters Chairs at [email protected] for any questions/clarifications about Call for Tutorial Proposals.
For queries on posters – please indicate “<BoF>” at the start of your Subject heading of your email.
