MétaCan
Menu
Back to cohort
Record W4312307445 · doi:10.33965/ijcsis_2019140202

HETEROGENEOUS DESIGN AND EFFICIENT CPU-GPU IMPLEMENTATION OF COLLISION DETECTION

2019· article· en· W4312307445 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIADIS INTERNATIONAL JOURNAL ON COMPUTER SCIENCE AND INFORMATION SYSTEMS · 2019
Typearticle
Languageen
FieldEngineering
TopicIndustrial Vision Systems and Defect Detection
Canadian institutionsToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of CanadaCMC Microsystems
KeywordsComputer scienceCollisionParallel computingCentral processing unitComputer hardwareComputer security

Abstract

fetched live from OpenAlex

Collison detection is a wide-ranging real-world application. It is one of the key components used in gaming, simulation and animation. Efficient algorithms are required for collision detection as it is repeatedly executed throughout the course of an application. Moreover, due to its computationally intensive nature researchers are investigating ways to reduce its execution time. This paper furthers those research works by devising a parallel CPU-GPU implementation of both broad and narrow phase collision detection with heterogenous workload sharing. An important aspect of co-scheduling is to determine an optimal CPU-GPU partition ratio. We also showcase a successive approximation approach for CPU-GPU implementation of collision detection. The paper demonstrates that the framework is not only applicable to CPU/GPU systems but to other system configuration obtaining a peak performance improvement in the range of 18%.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.291
Threshold uncertainty score0.464

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.011
GPT teacher head0.246
Teacher spread0.235 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it