A general solution to the P4P problem for camera with unknown focal length
This paper presents a general solution to the determination of the pose of a perspective
camera with unknown focal length from images of four 3D reference points. Our problem is a …
camera with unknown focal length from images of four 3D reference points. Our problem is a …
Defensive loop tiling for shared cache
B Bao, C Ding - Proceedings of the 2013 IEEE/ACM …, 2013 - ieeexplore.ieee.org
Loop tiling is a compiler transformation that tailors an application's working set to fit in a
cache hierarchy. On today's multicore processors, part of the hierarchy especially the last …
cache hierarchy. On today's multicore processors, part of the hierarchy especially the last …
Bandwidth guaranteed routing for ad-hoc networks with interference consideration
Z Jia, R Gupta, J Walrand… - 10th IEEE Symposium on …, 2005 - ieeexplore.ieee.org
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc
network is complicated because neighboring links share the medium. We define the path …
network is complicated because neighboring links share the medium. We define the path …
Understanding computation time: a critical discussion of time as a computational performance metric
Computation time is an important performance metric that scientists and software engineers
use to determine whether an algorithm is capable of running within a reasonable time frame …
use to determine whether an algorithm is capable of running within a reasonable time frame …
Performance metrics and models for shared cache
C Ding, X ** graph-based co-scheduling algorithms on multicore computers
It is common that multiple cores reside on the same chip and share the on-chip cache. As a
result, resource sharing can cause performance degradation of co-running jobs. Job co …
result, resource sharing can cause performance degradation of co-running jobs. Job co …
Code layout optimization for defensiveness and politeness in shared cache
Code layout optimization seeks to reorganize the instructions of a program to better utilize
the cache. On multicore, parallel executions improve the throughput but may significantly …
the cache. On multicore, parallel executions improve the throughput but may significantly …
Optimal footprint symbiosis in shared cache
On multicore processors, applications are run sharing the cache. This paper presents online
optimization to collocate applications to minimize cache interference to maximize …
optimization to collocate applications to minimize cache interference to maximize …
Compositional model of coherence and NUMA effects for optimizing thread and data placement
On today's multi-socket systems, the parallel performance is hampered by remote cache and
memory access. There is much prior work on thread and data placement to curb remote …
memory access. There is much prior work on thread and data placement to curb remote …
Hera: A Heterogeneity-Aware Multi-Tenant Inference Server for Personalized Recommendations
While providing low latency is a fundamental requirement in deploying recommendation
services, achieving high resource utility is also crucial in cost-effectively maintaining the …
services, achieving high resource utility is also crucial in cost-effectively maintaining the …