English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105278 (86%)
Visitors : 9208317      Online Users : 930
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/16522


    Title: Clustering Algorithm for Parallelizing Software Systems in Multi-Processors Environment
    Authors: 蔡進發;Jeffrey, J.P.Tsai
    Contributors: 生物與醫學資訊學系
    Keywords: "Parallel processing;software environment;synchronous communication;clustering algorithm;distributed application;deadlock "
    Date: 2000
    Issue Date: 2012-11-23 17:14:12 (UTC+8)
    Abstract: "A variety of techniques and tools exist to parallelize software systems on different parallel architectures (SIMD, MIMD).
    With the advances in high-speed networks, there has been a dramatic increase in the number of client/server applications. A variety of
    client/server applications are deployed today, ranging from simple telnet sessions to complex electronic commerce transactions.
    Industry standard protocols, like Secure Socket Layer (SSL), Secure Electronic Transaction (SET), etc., are in use for ensuring privacy
    and integrity of data, as well as for authenticating the sender and the receiver during message passing. Consequently, a majority of
    applications using parallel processing techniques are becoming synchronization-centric, i.e., for every message transfer, the sender
    and receiver must synchronize. However, more effective techniques and tools are needed to automate the clustering of such
    synchronization-centric applications to extract parallelism. In this paper, we present a new clustering algorithm to facilitate the
    parallelization of software systems in a multiprocessors environment. The new clustering algorithm achieves traditional clustering
    objectives (reduction in parallel execution time, communication cost, etc.). Additionally, our approach 1) reduces the performance
    degradation caused by synchronizations, and 2) avoids deadlocks during clustering. The effectiveness of our approach is depicted with
    the help of simulation results."
    Relation: IEEE Transactions on Software Engineering
    Appears in Collections:[生物資訊與醫學工程學系 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML111View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback