No abstract available.
Reviewers
Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely attractive for deploying applications at unprecedented scales. In this paper ...
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling algorithms have been proposed in the literature, which are mainly for ...
Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps
Self-stabilization is a novel method for achieving fault tolerance in distributed applications. A self-stabilizing algorithm will reach a legal set of states, regardless of the starting state or states adopted due to the effects of transient faults, in ...
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed systems, motivating designs that autonomously recover from transient faults and spontaneous reconfigurations. Self-stabilization ...
Snap-Stabilizing PIF and Useless Computations
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 time unit. Here, we propose the first snap-...
Efficient Updates in Highly Available Distributed Random Access Memory
With increased network speeds and throughputs, multicomputers (a system of computers connected by a high-speed network) have become an attractive alternative to store important data in their collective random access memory. Erasure codes provide ...
iDIBS: An Improved Distributed Backup System
iDIBS is a peer-to-peer backup system which optimizes the Distributed Internet Backup System (DIBS). iDIBS offers increased reliability by enhancing the robustness of existing packet transmission mechanism. Reed-Solomon erasure codes are replaced with ...
Research on Object-Storage-Based Intrusion Detection
Storage-based intrusion detection systems (IDS) can be valuable tools in monitoring for the intrusion on a host computer. However, because the traditional storage device works on the block-level while intrusion always happens on the file-level, this gap ...
LMPI: MPI for Heterogeneous Embedded Distributed Systems
Message Passing Interface (MPI) is an important standard that allows message-passing applications to run on many heterogeneous message-passing distributed systems without any change. There are a tremendous number of MPI implementations that are, however,...
Scalable Hybrid Designs for Linear Algebra on Reconfigurable Computing Systems
Recently, reconfigurable computing systems have been built which employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors. These systems provide new opportunities for highperformance computing. In this paper, ...
A Dynamic Lock Protocol for Scope-Consistency sDSM Systems
In this paper we examine the approach of enabling parallel processing of general applications on top of Grids by adapting and extending methods that have been used successfully for tightly coupled systems. Our approach is based on the fundamental design ...
Dynamic Resource Management Heuristics for Minimizing Makespan while Maintaining an Acceptable Level of Robustness in an Uncertain Environment
Heterogeneous parallel and distributed computing systems may operate in an environment where certain system performance features degrade due to unpredictable circumstances. Robustness can be defined as the degree to which a system can function correctly ...
Resource Allocation Framework for Distributed Real-Time End-To-End Tasks
Traditional resource allocation algorithms such as Q-RAM [11] assume that importance (or weight) or utility values for distributed real-time tasks is a totally ordered set to measure the rewards for completing every task. Hence, resource allocation ...
The Impact of Information Availability and Workload Characteristics on the Performance of Job Co-allocation in Multi-clusters
In this paper, we utilize a bandwidth-centric job communication model that captures the interaction and impact of simultaneously co-allocating jobs across multiple clusters. We make use of a parallel job model that seeks to capture both local and global ...
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets due to their sheer size; not only the extent of the existing patterns, but ...
Scalable Parallel Implementation of Exact Inference in Bayesian Networks
We present a scalable parallel implementation for exact inference in Bayesian Networks. We explore two levels of parallelization: top level parallelization which uses pointer jumping to stride across nodes; and node level parallelization which ...
A Parallel Independent Component Analysis Algorithm
Independent Component Analysis (ICA), orienting as an efficient approach to the blind source separation (BSS) problem, searches for a linear or nonlinear transformation that minimizes the statistical dependence between source signals. However, ICA has ...
Secure and High-Performance Web Server System for Shared Hosting Service
We developed Hi-sap, a web server system that ensures the security in a server and has high performance when processing dynamic content. In existing servers, server embedded programs cannot be used safely in large-scale environments like a shared ...
A Pure Nash Equilibrium Guaranteeing Game Theoretical Replica Allocation Method for Reducing Web Access Time
This paper proposes a non-cooperative game theoretical replica allocation technique (NCOR) to reduce user perceived Web access delays. NCOR uses distributed agents that because of their local knowledge act in a self-interested manner in order to enhance ...
Experiences with Simulations - A Light and Fast Model for Secure Web Applications
Using simulations of a complex system such as a Web Application Server provides us with a tool that allows the running of tests without using the resources needed in a real system; thus enabling a "what-if" analysis platform that gives support in the ...
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network
We are presenting here a routing protocol based on our modified algorithm of multicommodity flow. Here the flow converges more along those routes, which have maximum gradient of accumulated commodity. We have proved that this is indeed a shortest path ...
On the Effects of Consistency in Data Operations in Wireless Sensor Networks
In battery powered systems such as wireless sensor networks, energy eficiency is one of the most important system design goals. In this paper, energy eficiency is examined from the perspective of data consistency, which includes both temporal ...
Efficient Cache Replacement in Mobile Environment Using Data Profit
Caching is a key technique in mobile computing environment for improving the data retrieval performance. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. It has been ...
Destination-Based HoL Blocking Elimination
In future interconnection networks, congestion management is likely to become a critical issue owing to increasing power consumption and cost concerns. As congested packets introduce head-of-line (HoL) blocking to the rest of packets, congestion spreads ...
Providing Quality of Service over Advanced Switching
Advanced Switching (AS) is a new fabric-interconnect technology, which provides the advanced features of existing proprietary fabrics in an open standard. AS is intended to proliferate in multiprocessor, storage, networking, servers, and embedded ...
OBN: Peering for Finding Suppliers in P2P On-demand Streaming Systems
A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimization) to a given peer. For P2P on-demand streaming systems that fetch data ...