Browsing by Keywords "Load balancing"
Now showing items 1-18 of 18
-
Balancing computation load and communication overhead with multilevel self organizing maps
(Bilkent University, 2001-07) -
Combined use of prioritized AIMD and flow-based traffic splitting for robust TCP load balancing
(Springer, 2004)In this paper, we propose an AIMD-based TCP load balancing architecture in a backbone network where TCP flows are split between two explicitly routed paths, namely the primary and the secondary paths. We propose that primary ... -
Data decomposition techniques for parallel tree-based k-means clustering
(Bilkent University, 2002)The main computation in the k-means clustering is distance calculations between cluster centroids and patterns. As the number of the patterns and the number of centroids increases, time needed to complete computations ... -
Improving medium-grain partitioning for scalable sparse tensor decomposition
(Institute of Electrical and Electronics Engineers, 2018)Tensor decomposition is widely used in the analysis of multi-dimensional data. The canonical polyadic decomposition (CPD) is one of the most popular decomposition methods and commonly found by the CPD-ALS algorithm. High ... -
Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems
(Elsevier BV, 2016)We propose a comprehensive and generic framework to minimize multiple and different volume-based communication cost metrics for sparse matrix dense matrix multiplication (SpMM). SpMM is an important kernel that finds ... -
Improving the performance of independent task assignment heuristics Minmin, Maxmin and Sufferage
(Institute of Electrical and Electronics Engineers, 2014)MinMin, MaxMin, and Sufferage are constructive heuristics that are widely and successfully used in assigning independent tasks to processors in heterogeneous computing systems. All three heuristics are known to run in O(K ... -
Latency-centric models and methods for scaling sparse operations
(Bilkent University, 2016-07)Parallelization of sparse kernels and operations on large-scale distributed memory systems remains as a major challenge due to ever-increasing scale of modern high performance computing systems and multiple con icting ... -
Multipath based traffic engineering in MPLS networks
(Bilkent University, 2002-09) -
A neural network based approach for call admission control in heterogeneous networks
(Zhengzhou University, 2014)The next generation wireless networks will be based on infrastructure with the support of heterogeneous networks. In such a scenario, the users will be mobile between different networks; therefore the number of handovers ... -
One-dimensional partitioning for heterogeneous systems: theory and practice
(Academic Press, 2008-11)We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors ... -
Online balancing two independent criteria
(Springer, 2008-10)We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ... -
Online bicriteria load balancing for distributed file servers
(IEEE, 2008-08)We study the online bicriteria load balancing problem in a system of M distributed homogeneous file servers located in a cluster. The load and storage space are assumed to be independent. We propose two online approximate ... -
Optimal access point selection in multi-channel IEEE 80211 networks
(Bilkent University, 2008)A wireless access point (WAP or AP) is a device that allows wireless communication devices to connect to a wireless local area network (WLAN). AP usually connects to a wired network, and can relay data between the ... -
Optimizing nonzero-based sparse matrix partitioning models via reducing latency
(Academic Press, 2018)For the parallelization of sparse matrix-vector multiplication (SpMV) on distributed memory systems, nonzero-based fine-grain and medium-grain partitioning models attain the lowest communication volume and computational ... -
Parallel stochastic gradient descent on multicore architectures
(Bilkent University, 2020-09)The focus of the thesis is efficient parallelization of the Stochastic Gradient Descent (SGD) algorithm for matrix completion problems on multicore architectures. Asynchronous methods and block-based methods utilizing 2D ... -
PHR: A parallel hierarchical radiosity system with dynamic load balancing
(Springer, 2005)In this paper, we present a parallel system called PHR for computing hierarchical radiosity solutions of complex scenes. The system is targeted for multi-processor architectures with distributed memory. The system evaluates ... -
A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously
(IEEE Computer Society, 2017)Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either ... -
True load balancing for Matricized Tensor Times Khatri-Rao Product
(IEEE, 2021-01-22)MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important ...
