Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
We introduce a distributed and tractable mechanism for the allocation of continuously divisible resources to agents, that locally maximises the (Nash) product of their individual ...
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
This paper takes a renewed look at the problem of managing intermediate data that is generated during dataflow computations (e.g., MapReduce, Pig, Dryad, etc.) within clouds. We d...
Steven Y. Ko, Imranul Hoque, Brian Cho, Indranil G...
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...