Proceedings of the 17th international conference on Parallel architectures and compilation techniques
Bibliographic record
Abstract
It is our pleasure to welcome you to the 17th International Conference on Parallel Architectures and Compilation Techniques (PACT 2008). PACT brings together researchers from computer architecture, compilers, applications, and programming languages to present and discuss research of common interest. PACT 2008 features research on a broad range of topics, including parallel architectures, compilers, tools, benchmarks, I/O, reconfigurable architectures, middleware and runtime systems, hardware support for multithreading, and memory hierarchy design and programming. There were 159 submissions to the conference, a strong number of submissions again. The submitted papers underwent a thorough review process. Each paper was assigned to at least 3 program committee members to review. For most papers, at least one external review from an outside expert was obtained as well. There was an author feedback period, where authors could provide feedback on preliminary reviews. Authors could address questions from reviewers and correct factual errors. The program committee did an admirable job of reviewing the papers in a relatively short time frame. On average, each committee member had about 21 papers to review. Committee members were assigned papers in early April and reviews were due on Monday, May 19th to accommodate the author feedback period. The author feedback period was from May 21st to May 23rd . The committee met on Monday, June 2nd at Stanford University. The committee accepted 30 papers, for an acceptance rate of about 19%. We are pleased to be meeting in the beautiful city of Toronto, Canada. We hope that you will enjoy Toronto in late October. The technical program includes talks for 30 papers and two keynotes. There is a special event at the CN tower on Tuesday evening, as well as plenty of time for socializing and discussing on-going research. There are also 5 tutorials and 3 workshops the weekend before the main conference.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.006 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.005 |
| Insufficient payload (model declined to judge) | 0.129 | 0.070 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".