Computer Communication & Collaboration

Computer Communication & Collaboration

ISSN:2292-1028 (Print)    ISSN:2292-1036(Online)

Vol. 3, Issue 2 (2015.5)

Table of Contents

Editorial Board of CCC

Articles

----------------------------------------------------------------------------------

1. Efficient Resource Scheduling for Big Data Processing on Accelerator-Based Heterogeneous Systems [Download PDF]

Authors:

Ayman Tarakji, David Hebbeker and Lyubomir Georgiev

Abstract:

The involvement of accelerators is becoming widespread in the field of heterogeneous processing, performing computation tasks through a wide range of applications. In this paper, we examine the heterogeneity in modern computing systems, particularly, how to achieve a good level of resource utilization and fairness, when multiple tasks with different load and computation ratios are processed. First, we present OCLSched, an OpenCL-based scheduler that is designed as a multi-user computing environment to make use of the full potential of available resources in heterogeneous compute systems. Multiple tasks can be issued by means of a C++ API that relies on the OpenCL C++ wrapper. At this point, our scheduler takes over the control immediately and performs load scheduling. Due to its implementation, our approach can be easily applicable to a common OS. We validate our method through extensive experiments deploying a set of applications, which show that the low scheduling costs remain constant in total over a wide range of input size. Then, we demonstrate the ability of our scheduling approach to manage the nontrivial applications, bringing the ability of OCLSched to handle complex applications to the front. Besides the general computation tasks used in our experiments, we want to present a new implementation concept of a recent stream data clustering algorithm DenStream. Based on a specially designed task concept, the clustering functionality is described as a single user process within our scheduler, achieving its defined targets asynchronous to other general purpose computations. Besides the differerent CPUs, a variety of modern GPU and other accelerator architectures are used in this work including: AMD's Graphics Core Next, NVIDIA's Kepler, and the Intel MIC (Many Integrated Core) architecture.

Keywords:

GPGPU, OpenCL, Heterogeneous Parallel Systems, Scheduling, Client-server Model

2. Sheaf completeness of quantum logic [Download PDF]

Author:

Satoko Titani

Abstract:

Quantum logic is a counterpart of orthomodular lattice and interpreted in a sheaf of complete Boolean algebra. This means that quantum logic is interpreted in a family of classical worlds. The aim of this paper is to prove a sheaf completeness of quantum logic.

Keywords:

Orthomodular Lattice, Quantum Logic

3. Systems Based Adaptive and Preemptive Theory for Improving Pervasive IT Project Failure Trends ("AdaPIT" Theory)-"Preemptive and Adaptive Project Management"[Download PDF]

Author:

Rosana Roncatto Stoica

Abstract:

Evidence displays staging statistics reporting IT projects failure: a trend unchanged to date despite the multitude of attempted corrective measures. Challenging the rigid IT project management structures to date from a theoretical perspective leveraging Grounded, Systems and Social Theories, the authors uncovered a new (Complex Adaptive System (CAS) rooted) IT Project Management theory (AdaPIT Theory). This paper presents how the new theory emerged, presents its fundamental associations to CAS and sets the stage for a CAS based IT Project Management Framework and associated prescriptive measures already in progress.

Keywords:

Complex Adaptive Systems, IT Projects, Project Management

4. Notes On Finite Maximal Infix Codes[Download PDF]

Authors:

Chunhua Cao, Shun Shen, Di Yang(Correspondence author), Fengxia Zhang

Abstract:

The fact that every finite infix code is contained in a finite maximal infix code was given in 1994 by Ito and Thierrin. In this paper, we construct two kinds of maximal infix codes from a finite maximal infix code. Then we show that a finite infix code is a finite intersection of some finite maximal infix codes.

Keywords:

Infix Codes, Maximal Infix Code, Prefix Code, Maximal Prefix Code

  News   Announcements
  • Reviewers needed for all Journals