Performance

All posts under tag "Performance"

23 posts total

Sorted by date

FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search

We present FLASH (textbf{F}ast textbf{L}SH textbf{A}lgorithm for textbf{S}imilarity search accelerated with textbf{H}PC), a similarity search system for ultra-high dimensional datasets on a single machine, that does not require similarity computations and is tailored for high-performance computing p

February 23, 2026

Databases Distributed Computing Data Structures Computer Science Information Retrieval Performance

Significance of parallel computing on the performance of Digital Image Correlation algorithms in MATLAB

Digital Image Correlation (DIC) is a powerful tool used to evaluate displacements and deformations in a non-intrusive manner. By comparing two images, one of the undeformed reference state of a specimen and another of the deformed target state, the relative displacement between those two states is d

February 23, 2026

Computer Vision Performance Computer Science

Study and Analysis of MAC/IPAD Lab Configuration

This paper is about three virtualization modes: VMware, Parallels, and Boot Camping. The trade off of their testing is the hardware requirements. The main question is, among the three, which is the most suitable? The answer actually varies from user to user. It depends on the user needs. Moreover, i

February 23, 2026

Operating Systems Performance Analysis Computer Science

Throughput Limits of IEEE 802.11 and IEEE 802.15.3

IEEE 802.11 and IEEE 802.15.3 are wireless standards originally designed for wireless local area network (WLAN) and wireless personal area network (WPAN). This paper studies MAC throughput analysis of both standards. We present a comparative analysis of both standards in terms of MAC throughput and

February 23, 2026

Networking Performance Computer Science

High-Performance Physics Simulations Using Multi-Core CPUs and GPGPUs in a Volunteer Computing Context

This paper presents two conceptually simple methods for parallelizing a Parallel Tempering Monte Carlo simulation in a distributed volunteer computing context, where computers belonging to the general public are used. The first method uses conventional multi-threading. The second method uses CUDA, a

February 23, 2026

Physics Distributed Computing Performance Computer Science

Transaction Confirmation Time Prediction in Ethereum Blockchain Using Machine Learning

Blockchain offers a decentralized, immutable, transparent system of records. It offers a peer-to-peer network of nodes with no centralised governing entity making it unhackable and therefore, more secure than the traditional paper-based or centralised system of records like banks etc. While there ar

February 23, 2026

Learning Machine Learning Computer Science Cryptography and Security Statistics Performance

User Data Sharing Frameworks: A Blockchain-Based Incentive Solution

Currently, there is no universal method to track who shared what, with whom, when and for what purposes in a verifiable way to create an individual incentive for data owners. A platform that allows data owners to control, delete, and get rewards from sharing their data would be an important enabler

February 23, 2026

Databases Framework Data Computers and Society Computer Science Game Theory Cryptography and Security Performance

Characteristics of multithreading models for high-performance IO driven network applications

Characteristics of multithreading models for high-performance IO driven network applications

Characteristics of multithreading models for high-performance IO driven network applications

In a technological landscape that is quickly moving toward dense multi-CPU and multi-core computer systems, where using multithreading is an increasingly popular application design decision, it is important to choose a proper model for distributing tasks across multiple threads that will result in t

February 23, 2026

Model Network Computer Science Networking Performance

Performance Analysis of Software to Hardware Task Migration in Codesign

Performance Analysis of Software to Hardware Task Migration in Codesign

Performance Analysis of Software to Hardware Task Migration in Codesign

The complexity of multimedia applications in terms of intensity of computation and heterogeneity of treated data led the designers to embark them on multiprocessor systems on chip. The complexity of these systems on one hand and the expectations of the consumers on the other hand complicate the desi

February 23, 2026

Analysis Computer Science Performance

Stochastic Service Guarantee Analysis Based on Time-Domain Models

Stochastic Service Guarantee Analysis Based on Time-Domain Models

Stochastic Service Guarantee Analysis Based on Time-Domain Models

Stochastic network calculus is a theory for stochastic service guarantee analysis of computer communication networks. In the current stochastic network calculus literature, its traffic and server models are typically based on the cumulative amount of traffic and cumulative amount of service respecti

February 23, 2026

Analysis Model Computer Science Networking Performance

A Holistic Approach to Information Distribution in Ad Hoc Networks

A Holistic Approach to Information Distribution in Ad Hoc Networks

A Holistic Approach to Information Distribution in Ad Hoc Networks

We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it conforms to a predefined distribution and (ii) it is evenly and fa

February 23, 2026

Networking Computer Science Network Performance

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics

We propose a concise approximate description, and a method for efficiently obtaining this description, via adaptive random sampling of the performance (running time, memory consumption, or any other profileable numerical quantity) of a given algorithm on some low-dimensional rectangular grid of inpu

February 23, 2026

Computer Science Graphics Performance

On Mean Field Convergence and Stationary Regime

On Mean Field Convergence and Stationary Regime

On Mean Field Convergence and Stationary Regime

Assume that a family of stochastic processes on some Polish space $E$ converges to a deterministic process; the convergence is in distribution (hence in probability) at every fixed point in time. This assumption holds for a large family of processes, among which many mean field interaction models an

February 23, 2026

Computer Science Systems and Control Mathematics Performance

Big enterprise registration data imputation: Supporting spatiotemporal analysis of industries in China

Big enterprise registration data imputation: Supporting spatiotemporal analysis of industries in China

Big enterprise registration data imputation: Supporting spatiotemporal analysis of industries in China

Big, fine-grained enterprise registration data that includes time and location information enables us to quantitatively analyze, visualize, and understand the patterns of industries at multiple scales across time and space. However, data quality issues like incompleteness and ambiguity, hinder such

February 23, 2026

Analysis Computers and Society Data Computer Science Performance

Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks

Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks

Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks

Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However, these queue-length-based schemes could potentially suffer from l

February 23, 2026

Networking Computer Science Network Performance

Towards a native toplevel for the OCaml language

Towards a native toplevel for the OCaml language

Towards a native toplevel for the OCaml language

This paper presents the current state of our work on an interactive toplevel for the OCaml language based on the optimizing native code compiler and runtime. Our native toplevel is up to 100 times faster than the default OCaml toplevel, which is based on the byte code compiler and interpreter. It us

February 23, 2026

Programming Languages Computer Science Performance

Window-Based Greedy Contention Management for Transactional Memory

Window-Based Greedy Contention Management for Transactional Memory

Window-Based Greedy Contention Management for Transactional Memory

We consider greedy contention managers for transactional memory for M x N execution windows of transactions with M threads and N transactions per thread. Assuming that each transaction conflicts with at most C other transactions inside the window, a trivial greedy contention manager can schedule the

February 23, 2026

Distributed Computing Computer Science Data Structures Performance

An Improved Analytical Expression for Write Amplification in NAND Flash

An Improved Analytical Expression for Write Amplification in NAND Flash

An Improved Analytical Expression for Write Amplification in NAND Flash

Agarwal et al. gave an closed-form expression for write amplification in NAND flash memory by finding the probability of a page being valid over the whole flash memory. This paper gives an improved analytic expression for write amplification in NAND flash memory by finding the probability of a page

February 23, 2026

Computer Science Performance

Fundamentals of the Backoff Process in 802.11: Dichotomy of the Aggregation

Fundamentals of the Backoff Process in 802.11: Dichotomy of the Aggregation

Fundamentals of the Backoff Process in 802.11: Dichotomy of the Aggregation

This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. A simplistic principle founded upon regular variation theory is that the backoff time has a truncated Pareto-type tail distribution with an exponent of $(log gamma)/log m$ ($m$ is the mult

February 23, 2026

Networking Computer Science Performance

Understanding Fairness and its Impact on Quality of Service in IEEE 802.11

The Distributed Coordination Function (DCF) aims at fair and efficient medium access in IEEE 802.11. In face of its success, it is remarkable that there is little consensus on the actual degree of fairness achieved, particularly bearing its impact on quality of service in mind. In this paper we prov

February 23, 2026

Networking Performance Computer Science

The M/M/Infinity Service System with Ranked Servers in Heavy Traffic

The M/M/Infinity Service System with Ranked Servers in Heavy Traffic

The M/M/Infinity Service System with Ranked Servers in Heavy Traffic

We consider an M/M/Infinity service system in which an arriving customer is served by the first idle server in an infinite sequence S_1, S_2, ... of servers. We determine the first two terms in the asymptotic expansions of the moments of L as lambda tends to infinity, where L is the index of the ser

February 23, 2026

Computer Science Mathematics Performance System

Multi-domain performance analysis with scores tailored to user preferences

Multi-domain performance analysis with scores tailored to user preferences

Multi-domain performance analysis with scores tailored to user preferences

The performance of algorithms, methods, and models tends to depend heavily on the distribution of cases on which they are applied, this distribution being specific to the applicative domain. After performing an evaluation in several domains, it is highly informative to compute a (weighted) mean perf

February 23, 2026

Analysis Computer Science Performance

A Mean Field Approach for Optimization in Particles Systems and Applications

A Mean Field Approach for Optimization in Particles Systems and Applications

A Mean Field Approach for Optimization in Particles Systems and Applications

This paper investigates the limit behavior of Markov Decision Processes (MDPs) made of independent particles evolving in a common environment, when the number of particles goes to infinity. In the finite horizon case or with a discounted cost and an infinite horizon, we show that when the number of

February 23, 2026

Computer Science Networking System Mathematics Performance

< Category Statistics (Total: 5076) >

Astrophysics

670

Computer Science

1926

Condensed Matter

201

Economics

17

Electrical Engineering and Systems Science

104

General Relativity

64

General Research

786

HEP-EX

25

HEP-LAT

8

HEP-PH

82

HEP-TH

65

MATH-PH

74

NUCL-EX

6

NUCL-TH

14

Nonlinear Sciences

160

Quantitative Biology

295

Quantitative Finance

179

Quantum Physics

65

Statistics

202

Web Analytics