MétaCan
Menu
Back to cohort
Record W4237021852 · doi:10.1145/584385.584386

Application level performance optimizations for CORBA-based systems

2002· article· en· W4237021852 on OpenAlexaff
Weili Tao, Shikharesh Majumdar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsCommon Object Request Broker ArchitectureComputer scienceOperabilityMiddleware (distributed applications)Interoperable Object ReferenceObject request brokerDistributed computingProgrammerServerOperating systemObject-oriented programmingEmbedded systemDistributed objectSoftware engineering

Abstract

fetched live from OpenAlex

Middleware provides inter-operability in a heterogeneous distributed object computing environment. Common Object Request Broker (CORBA) is a standard for middleware proposed by OMG. Although inter-operability is achieved middleware often introduces overheads that impair system performance. This research is concerned with performance enhancement of CORBA-based systems by deploying appropriate techniques at the application level. The paper demonstrates that decisions made by the application software designer and programmer can have a large impact on the performance of a CORBA-based system. The paper presents a set of guidelines that can be used at the design and implementation levels for enhancing system performance. We focus on issues such as reduction of connection set up latency, appropriate techniques for parameter passing, impact of method placement on response time, performance implications of different ways of packing objects in servers and load balancing. Insights into system behavior that highlight the effectiveness of the guidelines as well as capture the relationship between the CORBA compliant middleware and overall application performance are presented.

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.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0020.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.061
GPT teacher head0.235
Teacher spread0.174 · 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 designBench or experimental
Domainnot available
GenreMethods

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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDistributed and Parallel Computing SystemsFrench-language works237,207