Sciweavers

505 search results - page 86 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
DAC
2003
ACM
15 years 10 months ago
Data communication estimation and reduction for reconfigurable systems
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
Adam Kaplan, Philip Brisk, Ryan Kastner
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
15 years 4 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
79
Voted
JSSPP
2009
Springer
15 years 4 months ago
Job Admission and Resource Allocation in Distributed Streaming Systems
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Suja...
IAT
2008
IEEE
15 years 4 months ago
Link-Based Anomaly Detection in Communication Networks
Communication networks, such as networks formed by phone calls and email communications, can be modeled as dynamic graphs with vertices representing agents and edges representing ...
Xiaomeng Wan, Evangelos E. Milios, Nauzer Kalyaniw...
OTM
2007
Springer
15 years 3 months ago
Decentralised Commitment for Optimistic Semantic Replication
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
Pierre Sutra, João Barreto, Marc Shapiro