MétaCan
Menu
Back to cohort
Record W48861060

Accelerating Image Processing in Flash using SIMD Standard Operations

2011· article· en· W48861060 on OpenAlexaff
Chamira Perera, Daniel Shapiro, Jonathan Parri, Miodrag Bolić, Voicu Groza

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsUniversity of OttawaCarleton University
Fundersnot available
KeywordsComputer scienceFlash (photography)Flash memory emulatorFlash file systemGraphicsImage processingReal-time computer graphicsSIMDComputer hardwareVector graphicsComputer graphics (images)Embedded systemMultimediaOperating systemImage (mathematics)Artificial intelligence3D computer graphicsComputer memory
DOInot available

Abstract

fetched live from OpenAlex

Flash applications have played an integral role in shaping the interactivity of the Internet. Desktop Flash applications feature vector-based processing such as image and video processing to enhance the user experience. In response to these needs, Adobe has added graphics card based acceleration for vector processing in Flash applications starting with Flash Player 10. This solution is limited to computer systems that have the proper graphics card. In this paper, we investigate the possibility of making explicit use of Single Instruction Multiple Data instructions, specifically SSE in the Intel x86-64 platforms, to accelerate vector operations in a Flash application. We also discuss certain limitations of the Flash virtual machine. The data reveals that a 90-92% speedup can be achieved by using SSE instructions to accelerate the alpha blending image processing algorithm in a Flash application. The SSE instructions are accessed by providing a standardized limited native interface to the Flash application.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.0060.001

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.078
GPT teacher head0.291
Teacher spread0.212 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicDistributed and Parallel Computing SystemsFrench-language works237,207