Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrew H. C. Chan

dblp:39/243 · also Andrew Chan 0002, Andrew Hin Cheong Chan · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-0042-8448ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
workflow scheduling
0.212022
Scheduling Algorithms for Efficient Execution of Stream Workflow Applications in Multicloud Environments · IEEE Trans. Serv. Comput. 2022
Mathematical optimization › evolutionary computation
genetic algorithm
0.212022
Scheduling Algorithms for Efficient Execution of Stream Workflow Applications in Multicloud Environments · IEEE Trans. Serv. Comput. 2022

Methods — techniques the papers use, named apart from their topics

resource allocation · 1.1multicloud scheduling · 1.1genetic algorithm · 1.1
YearPublicationVenuePosition
2022 Scheduling Algorithms for Efficient Execution of Stream Workflow Applications in Multicloud Environments
abstract
Big data processing applications are becoming more and more complex. They are no more monolithic in nature but instead they are composed of decoupled analytical processes in the form of a workflow. One type of such workflow applications is stream workflow application, which integrates multiple streaming big data applications to support decision making. Each analytical component of these applications runs continuously and processes data streams whose velocity will depend on several factors such as network bandwidth and processing rate of parent analytical component. As a consequence, the execution of these applications on cloud environments requires advanced scheduling techniques that adhere to end user’s requirements in terms of data processing and deadline for decision making. In this article, we propose two multicloud scheduling and resource allocation techniques for efficient execution of stream workflow applications on multicloud environments while adhering to workflow application and user performance requirements and reducing execution cost. Results showed that the proposed genetic algorithm is an adequate and effective for all experiments.
Mutaz Barika, Saurabh Kumar Garg 0001, Andrew H. C. Chan, Rodrigo N. Calheiros
IEEE Trans. Serv. Comput.3
2020 Deadline-based dynamic resource allocation and provisioning algorithms in Fog-Cloud environment
Ranesh Kumar Naha, Saurabh Kumar Garg 0001, Andrew H. C. Chan, Sudheer Kumar Battula
Future Gener. Comput. Syst.3
2019 IoTSim-Stream: Modelling stream graph application in cloud simulation
Mutaz Barika, Saurabh Kumar Garg 0001, Andrew H. C. Chan, Rodrigo N. Calheiros, Rajiv Ranjan 0001
Future Gener. Comput. Syst.3
2008 An element-by-element preconditioned Conjugate Gradient solver of 3D tetrahedral finite elements on an FPGA coprocessor
abstract
An element-by-element preconditioned conjugate gradient (PCG) iterative solver for the solution of 3D finite element analysis has been implemented into a FPGA-based 32-bit floating-point reconfigurable computer. The algorithm formulation has been chosen in order to optimize the match with the capabilities of the FPGA platform. It is capable of giving a speed-up of about 40 times compared to an optimized 64-bit software version running on a fast PC.
Jing Hu 0006, Steven F. Quigley, Andrew H. C. Chan
FPL3
2002 Analysis and Implementation of the Discrete Element Method Using a Dedicated Highly Parallel Architecture in Reconfigurable Computing
abstract
The Discrete Element Method (DEM) is a numerical model to describe the mechanical behaviour of discontinuous bodies. It has been traditionally used to simulate particle flows (e.g. sand, sugar), but is becoming more popular as a method to represent solid materials. The DEM is very computationally expensive, but has properties that make it amenable to acceleration by reconfigurable computing. This paper describes the implementation of a dedicated hardware architecture for the DEM implemented on an FPGA, which is capable of giving a speed-zip of about 30 times compared to an optimised software version running on a fast microprocessor.
Benjamin Carrión Schäfer, Steven F. Quigley, Andrew H. C. Chan
FCCM3
2002 Scalable Implementation of the Discrete Element Method on a Reconfigurable Computing Platform
Benjamin Carrión Schäfer, Steven F. Quigley, Andrew H. C. Chan
FPL3
2001 Evaluation of an FPGA Implementation of the Discrete Element Method
Benjamin Carrión Schäfer, Steven F. Quigley, Andrew H. C. Chan
FPL3