We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
Richard A. Dutton, Weizhen Mao, Jie Chen, William ...
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
The temporal resolution of dynamic MRI can be increased by sampling a fraction of k-space in an interleaved fashion, which causes spatial and temporal aliasing. We describe algebr...