3 research outputs found

    A task allocation protocol for real-time financial data mining system.

    Get PDF
    Lam Lui-fuk.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.Includes bibliographical references (leaves 75-76).Abstracts in English and Chinese.ABSTRACT --- p.I摘要 --- p.IIACKNOWLEDGEMENT --- p.IIITABLE OF CONTENTS --- p.IVLIST OF FIGURES --- p.VIIILIST OF ABBREVIATIONS --- p.XChapter CHAPTER 1 --- INTRODUCTION --- p.1Chapter 1.1 --- Introduction --- p.1Chapter 1.2. --- Motivation and Research Objective --- p.3Chapter 1.3. --- Organization of the Dissertation --- p.3Chapter CHAPTER 2 --- BACKGROUND STUDIES --- p.5Chapter 2.1 --- The Contract Net Protocol --- p.5Chapter 2.2 --- Two-tier software architectures --- p.8Chapter 2.3 --- Three-tier software architecture --- p.9Chapter CHAPTER 3 --- SYSTEM ARCHITECTURE --- p.12Chapter 3.1 --- Introduction --- p.12Chapter 3.2 --- System Architecture Overview --- p.12Chapter 3.2.1 --- Client Layer --- p.13Chapter 3.2.2 --- Middle Layer --- p.13Chapter 3.2.3 --- Back-end Layer --- p.14Chapter 3.3 --- Advantages of the System Architecture --- p.14Chapter 3.3.1 --- "Separate the presentation components, business logic and data storage" --- p.14Chapter 3.3.2 --- Provide a central-computing platform for user using different computing platforms --- p.15Chapter 3.3.3 --- Improve system capacity --- p.15Chapter 3.3.4 --- Enable distributed computing --- p.16Chapter CHAPTER 4. --- SOFTWARE ARCHITECTURE --- p.17Chapter 4.1 --- Introduction --- p.17Chapter 4.2 --- Descriptions of Middle Layer Server Side Software Components --- p.17Chapter 4.2.1 --- Data Cache --- p.18Chapter 4.2.2 --- Functions Library --- p.18Chapter 4.2.3 --- Communicator --- p.18Chapter 4.2.4 --- Planner Module --- p.19Chapter 4.2.5 --- Scheduler module --- p.19Chapter 4.2.6 --- Execution Module --- p.20Chapter 4.3 --- Overview the Execution of Service Request inside Server --- p.20Chapter 4.4 --- Descriptions of Client layer Software Components --- p.21Chapter 4.4.1 --- Graphical User Interface --- p.22Chapter 4.5 --- Overview of Task Execution in Advanced Client ´ةs Application --- p.23Chapter 4.6 --- The possible usages of task allocation protocol --- p.24Chapter 4.6.1 --- Chart Drawing --- p.25Chapter 4.6.2 --- Compute user-defined technical analysis indicator --- p.25Chapter 4.6.3 --- Unbalance loading --- p.26Chapter 4.6.4 --- Large number of small data mining V.S. small number of large data mining --- p.26Chapter 4.7 --- Summary --- p.27Chapter CHAPTER 5. --- THE CONTRACT NET PROTOCOL FOR TASK ALLOCATION --- p.28Chapter 5.1 --- Introduction --- p.28Chapter 5.2 --- The FIPA Contract Net Interaction Protocol --- p.28Chapter 5.2.1 --- Introduction to the FIPA Contract Net Interaction Protocol --- p.28Chapter 5.2.2 --- Strengths of the FIPA Contract Net Interaction Protocol for our system --- p.30Chapter 5.2.3 --- Weakness of the FIPA Contractor Net Interaction Protocol for our system --- p.32Chapter 5.3 --- The Modified Contract Net Protocol --- p.33Chapter 5.4 --- The Implementation of the Modified Contract Net Protocol --- p.39Chapter 5.5 --- Summary --- p.46Chapter CHAPTER 6. --- A CLIENT AS SERVER MODEL USING MCNP FOR TASK ALLOCATION --- p.48Chapter 6.1 --- Introduction --- p.48Chapter 6.2 --- The CASS System Model --- p.48Chapter 6.3 --- The analytical model of the CASS system --- p.51Chapter 6.4 --- Performance Analysis of the CASS System --- p.55Chapter 6.5 --- Performance Simulation --- p.62Chapter 6.6 --- An Extension of the Load-Balancing Algorithm for Non-Uniform Client's Service Time Distribution --- p.68Chapter 6.7 --- Summary --- p.69Chapter CHAPTER 7. --- CONCLUSION AND FUTURE WORK --- p.71Chapter 7.1 --- Conclusion --- p.71Chapter 7.2 --- Future Work --- p.73BIBLIOGRAPHY --- p.7

    Hybrid approach to task allocation in distributed systems

    No full text
    This paper describes the hybrid approach to task allocation in distributed systems by using problem solving methods of the artificial intelligence. For static mapping the objective function is used to evaluate the optimality of the allocation of a task graph onto a processor graph. Together with our optimization method also augmented simulated annealing and heuristic move exchange methods in distributed form are implemented.  For dynamic task allocation the semidistributed approach was designed based on the division of processor network topology into independent and symmetric spheres. Distributed static mapping (DSM) and  dynamic load balancing (DLB) tools are controlled by user window interface. DSM and DLB tools are integrated together with software monitor (PG_PVM) in the graphical GRAPNEL environment

    Hybrid Task Allocation Tool for Distributed Systems

    No full text
    This paper describes the hybrid approach to task allocation in distributed systems by using problem-solving methods of the artificial intelligence. For the static mapping the objective function is used to evaluate the optimality of the allocation of a task graph onto a processor graph. Together with our optimization method also augmented simulated annealing and heuristic move exchange methods in distributed form are implemented. For dynamic task allocation the semidistributed approach was designed based on the division of processor network topology into independent and symmetric spheres. Distributed static mapping (DSM) and dynamic load balancing (DLB) tools are controlled by user window interface. DSM and DLB tools are integrated together with software monitor (PG PVM) in the graphical GRAPNEL environment. 1. Introduction Optimal planning of parallel program execution in parallel and distributed systems solves the problem of minimization of execution time. The theory of optimal alloc..
    corecore