2,352 research outputs found
Consensus State Gram Matrix Estimation for Stochastic Switching Networks from Spectral Distribution Moments
Reaching distributed average consensus quickly and accurately over a network
through iterative dynamics represents an important task in numerous distributed
applications. Suitably designed filters applied to the state values can
significantly improve the convergence rate. For constant networks, these
filters can be viewed in terms of graph signal processing as polynomials in a
single matrix, the consensus iteration matrix, with filter response evaluated
at its eigenvalues. For random, time-varying networks, filter design becomes
more complicated, involving eigendecompositions of sums and products of random,
time-varying iteration matrices. This paper focuses on deriving an estimate for
the Gram matrix of error in the state vectors over a filtering window for
large-scale, stationary, switching random networks. The result depends on the
moments of the empirical spectral distribution, which can be estimated through
Monte-Carlo simulation. This work then defines a quadratic objective function
to minimize the expected consensus estimate error norm. Simulation results
provide support for the approximation.Comment: 52nd Asilomar Conference on Signals, Systems, and Computers (Asilomar
2017
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
In this paper, we perform an empirical evaluation of the Parallel External
Memory (PEM) model in the context of geometric problems. In particular, we
implement the parallel distribution sweeping framework of Ajwani, Sitchinava
and Zeh to solve batched 1-dimensional stabbing max problem. While modern
processors consist of sophisticated memory systems (multiple levels of caches,
set associativity, TLB, prefetching), we empirically show that algorithms
designed in simple models, that focus on minimizing the I/O transfers between
shared memory and single level cache, can lead to efficient software on current
multicore architectures. Our implementation exhibits significantly fewer
accesses to slow DRAM and, therefore, outperforms traditional approaches based
on plane sweep and two-way divide and conquer.Comment: Longer version of ESA'13 pape
Workflow Scheduling Techniques and Algorithms in IaaS Cloud: A Survey
In the modern era, workflows are adopted as a powerful and attractive paradigm for expressing/solving a variety of applications like scientific, data intensive computing, and big data applications such as MapReduce and Hadoop. These complex applications are described using high-level representations in workflow methods. With the emerging model of cloud computing technology, scheduling in the cloud becomes the important research topic. Consequently, workflow scheduling problem has been studied extensively over the past few years, from homogeneous clusters, grids to the most recent paradigm, cloud computing. The challenges that need to be addressed lies in task-resource mapping, QoS requirements, resource provisioning, performance fluctuation, failure handling, resource scheduling, and data storage. This work focuses on the complete study of the resource provisioning and scheduling algorithms in cloud environment focusing on Infrastructure as a service (IaaS). We provided a comprehensive understanding of existing scheduling techniques and provided an insight into research challenges that will be a possible future direction to the researchers
- …