Concept
Directed acyclic graph
Related publications (260)
A Unified Online Directed Acyclic Graph Flow Manager for Multicore Schedulers
David Atienza Alonso, Karim Kanoun
Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core systems. However, the DAG monitoring modules proposed by these schedulers make a priori assumptions about the workload and relations ...
2014A Unified Online Directed Acyclic Graph Flow Manager for Multicore Schedulers
David Atienza Alonso, Karim Kanoun
Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core systems. However, the DAG monitoring modules proposed by these schedulers make a priori assumptions about the workload and relations ...
IEEE2014PrefEdge: SSD Prefetcher for Large-Scale Graph Traversal
Mining large graphs has now become an important aspect of multiple diverse applications and a number of computer systems have been proposed to provide runtime support. Recent interest in this area has led to the construction of single machine graph computa ...
2014Scale-Out NUMA
Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic
Emerging datacenter applications operate on vast datasets that are kept in DRAM to minimize latency. The large number of servers needed to accommodate this massive memory footprint requires frequent server-to-server communication in applications such as ke ...
2014Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms
David Atienza Alonso, Karim Kanoun
Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core platforms. However, these schedulers make a priori assumptions about the relationship between the task dependencies, and they are un ...
Institute of Electrical and Electronics Engineers2014How to Localize Ten Microphones in One Fingersnap
Martin Vetterli, Ivan Dokmanic
A compelling method to calibrate the positions of microphones in an array is with sources at unknown locations. Remarkably, it is possible to reconstruct the locations of both the sources and the receivers, if their number is larger than some prescribed mi ...
IEEE2014Non-linear Low-rank and Sparse Representation for Hyperspectral Image Analysis
Jean-Philippe Thiran, Devis Tuia, Volker Gass, Frank Grégoire Jean de Morsier, Maurice Borgeaud
In this paper, we tackle the problem of unsupervised classification of hyperspectral images. We propose a clustering method based on graphs representing the data structure, which is assumed to be an union of multiple manifolds. The method constraints the p ...
2014Systems and methods for spray drying in microfluidic and other systems
The present invention generally relates to microfluidics, and to spray drying and other drying techniques. By at least partially drying fluids within a microfluidic channel, instead of or in addition to conventional spray drying techniques, better control ...
2014Supercriticality of an annealed approximation of Boolean networks
Thomas Mountford, Daniel Rodrigues Valesin
We consider a model recently proposed by Chatterjee and Durrett [1] as an "annealed approximation" of boolean networks, which are a class of cellular automata on a random graph, as defined by S. Kauffman [5]. The starting point is a random directed graph o ...
Univ Washington, Dept Mathematics2013Active topology inference using network coding
Our goal, in this paper, is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition ...
2013