this paper deals withthe learning of the membership functions for Mamdani Fuzzy Systems the number of labels of the variables and the tuning of them in order to obtain a set of Linguistic Fuzzy Systems with different...
详细信息
ISBN:
(纸本)9781424447350
this paper deals withthe learning of the membership functions for Mamdani Fuzzy Systems the number of labels of the variables and the tuning of them in order to obtain a set of Linguistic Fuzzy Systems with different trade-offs between accuracy and complexity, through the use of a two-level evolutionary multi-objective algorithm. the presented methodology employs a high level main evolutionary multi-objective heuristic searching the number of labels, and some distributed low level ones, also evolutionary, tuning the membership functions of the candidate variable partitions.
We propose an approximation algorithm for the problem of Fault-Tolerant Facility Location which is implemented in a distributed and asynchronous manner within O(n) rounds of communication. Here n is the number of vert...
详细信息
ISBN:
(纸本)9781424452910
We propose an approximation algorithm for the problem of Fault-Tolerant Facility Location which is implemented in a distributed and asynchronous manner within O(n) rounds of communication. Here n is the number of vertices in the network. As far as we know, the performance guarantee of similar algorithms (centralized) remains unknown except a special case where all cities have a uniform connectivity requirement. In this paper, we assume the shortest-path routing scheme deployed, as well as a constant (given) size of R, which represents the distinct levels of fault-tolerant capability provided by the system (i.e distinct connectivity requirements), and prove that the cost of our solution is no more than vertical bar R vertical bar . F* + C* in the general case, where F* and C* are respectively the facility cost and connection cost in an optimal solution. Further more, extensive numerical experiments showed that the quality of our solutions is comparable to the optimal solutions when vertical bar R vertical bar is no more than 10.
the main contribution of this paper is to present an efficient parallel sorting "psort" compatible withthe standard qsort. Our parallel sorting "psort" is implemented such that its interface is co...
详细信息
ISBN:
(纸本)9781424452910
the main contribution of this paper is to present an efficient parallel sorting "psort" compatible withthe standard qsort. Our parallel sorting "psort" is implemented such that its interface is compatible with "qsort" in C Standard Library. therefore, any application program that uses standard "qsort" can be accelerated by simply replacing "qsort" call by our "psort". Also, "psort" uses standard "qsort" as a "subroutine for local sequential sorting. So, if the performance of "qsort" is improved by anyone in the community, then that of our "psort" is also automatically improved. To evaluate the performance of our "psort", we have implemented our parallel sorting in a Linux server with two Intel quad-core processors (i.e. eight processor cores). the experimental results show that our "psort" is approximately 6 times faster than standard "qsort" using 8 processors. Since the speed up factor cannot be more than 8 if we use 8 cores, our algorithm is close to optimal. Also, as far as we know, no previously published parallel implementations achieve a speed up factor less than 4 using 8 cores.
Due to fast growth of video camera market, referring videos in sports training has been used as one of the most effective methods for improving their performance because athletes or coaches can analyze their performan...
详细信息
ISBN:
(纸本)9781424452910
Due to fast growth of video camera market, referring videos in sports training has been used as one of the most effective methods for improving their performance because athletes or coaches can analyze their performance objectively. Adopting the advices from coaches, athletes can correct their wrong habits in their performance instantly. Although the videos from multiple cameras in multiple angles include much useful information, it is very hard for them to extract the information from the videos during their limited training time. Introducing an actual example of the training field where multiple cameras are used, this paper is focused on development of new video synthesizing software that generates a single video from the multiple videos, applying a sequence of commands to control the synthesis. this paper also describes an optimization technique to perform the video synthesis fast that applies parallel processing on a multicore processor to invoke multiple threads for video synthesis concurrently. Performance evaluation shows validity of the optimization technique.
Traditional Grid data management systems have been developed oil the supposition that the network bandwidth is unconstrained with dedicated broadband network lines and the storage space is enough for storing replicas....
详细信息
ISBN:
(纸本)9783642030949
Traditional Grid data management systems have been developed oil the supposition that the network bandwidth is unconstrained with dedicated broadband network lines and the storage space is enough for storing replicas. this paper proposes a storage service for distributedcomputing systems without the supposition, by adopting the concept of pervasive storage in the distributedcomputing. the Sharable Storage space is recognized as the application server's local storage. Whenever the user commits, data transfer is automatically performed using iSCSI protocol. the storage service is destined for numerous data transfer of relatively small filed, and simulated under the condition of a restrictive network bandwidth. File preloading function could make the applications start early without dedicated broadband network lines. the computing sites could benefit from the proposed storage service than waiting until the whole file is transferred for replication and keeping the replica stored without the users' explicit note for reuse.
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for HT-based dense polynomial multip...
详细信息
ISBN:
(纸本)9781424452910
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for HT-based dense polynomial multiplication targeting multi-cores. We show that balanced input data can maximize parallel speedup and minimize cache complexity for bivariate multiplication. However, unbalanced input data, which are common in symbolic computation, are challenging. We provide efficient techniques, what we call contraction and extension, to reduce multivariate (and univariate) multiplication to balanced bivariate multiplication. Our implementation in Cilk++ demonstrates good speedup on multi-cores.
Peer-to-peer (P2P) systems are, in contrast to client-server (C/S) systems, fault-tolerant, robust, and scalable. While C/S distributed file systems, such as NFS (Network File System) or SMB (Server Message Block), do...
详细信息
ISBN:
(纸本)9781424452910
Peer-to-peer (P2P) systems are, in contrast to client-server (C/S) systems, fault-tolerant, robust, and scalable. While C/S distributed file systems, such as NFS (Network File System) or SMB (Server Message Block), do not scale with respect to the number of clients and exhibit a single point of failure, P2P file systems have the potential to cope with an increasing number of participants. thus, this paper presents DRFS (distributed Reliable File System), a P2P file system for cooperative environments. DRFS uses random, content-independent identifiers for data storage, while maintaining high performance and low overhead with many concurrent reads and writes. A dynamic replication mechanism ensures data availability, even under high churn. the application scenario considers an office environment, where DRFS is installed on employees' machines, who store and request files. DRFS has been implemented using the Filesystem in Userspace (FUSE) interface, in order to provide users with transparent read and write operations. Experiments show the benefits of such a peer-to-peer architecture, when a small number of peers reads or writes in parallel: DRFS performs better than NFS, as soon as 6 peers read or write in parallel a 32 MB file. For unpopular files, it is also more reliable than IgorFS.
this work presents a study undertaken to characterise the FINISTERRAE supercomputer, one of the biggest NUMA systems in Europe. the main objective was to determine the performance effect of bus contention and cache co...
详细信息
ISBN:
(纸本)9781424452910
this work presents a study undertaken to characterise the FINISTERRAE supercomputer, one of the biggest NUMA systems in Europe. the main objective was to determine the performance effect of bus contention and cache coherency as well as the suitability of porting strategies regarding irregular codes in such a complex architecture. Results show that: (1) cores which share a socket can be considered as independent processors in this context;(2) for big data sizes, the effect of sharing a bus degrades the final performance but masks the cache coherency effects;(3) the NUMA factor (remote to local memory latency ratio) is an important factor on irregular codes and (4) the default kernel allocation policy is not optimal in this system. these results allow us to understand the behaviour of thread-to-core mappings and memory allocation policies.
though XML is applied intensively in a lot of applications, XML parsing is not practical in many fields because of its poor performance. parallel XML parsing on multi-core is a promising choice. Previous methods all a...
详细信息
ISBN:
(纸本)9781424452910
though XML is applied intensively in a lot of applications, XML parsing is not practical in many fields because of its poor performance. parallel XML parsing on multi-core is a promising choice. Previous methods all adopt data parallel approach on XML parsing. As the semi-structured nature of XML, they were obliged to divide the data into well-formed XML chunks and then parse these chunks parallel. the division process is named as preparsing. As the preparsing is serial, it becomes the bottleneck of parallel XML parsing. Related work Simultaneous Finite Transducer (SFTXP) :parallelized the preparsing stage. It maintained multiple preparser results for each equal sized chunk according to enumerated all possible parsing states. In spite of finite states for each XML, the overhead by SFTXP is tremendous, including CPU time and memory for multiple results generating and storing, respectively. In this work, we address parallel XML parsing by Key Element Parse Tracing (KEPT) method which parallelizes the preparsing and parsing at element level. It remolds the preparsing as a key element extracting process and schedules the processing of key elements in 1:he framework of KEPT. then parsing process is parallelized as a whole. To demonstrate the effectiveness, we implement it on libxml2 and obtain good scalability on both an 8-core Linux machine and an 8-core 24 SMT Sun machine running Solaris.
this paper presents the scheduling strategies framework for distributedcomputing. the fact that architecture of the computational environment is distributed, heterogeneous, and dynamic along with autonomy of processo...
详细信息
ISBN:
(纸本)9783642032745
this paper presents the scheduling strategies framework for distributedcomputing. the fact that architecture of the computational environment is distributed, heterogeneous, and dynamic along with autonomy of processor nodes, makes it much more difficult to manage and assign resources for job execution which fulfils user expectations for quality of service (QoS). the strategies are implemented using a combination of job-flow and application-level techniques of scheduling and resource co-allocation within virtual organizations of Grid. applications are regarded as compound jobs with a complex structure containing several tasks. Strategy is considered as a set of possible job scheduling variants with a coordinated allocation of the tasks to the processor nodes. the choice of the specific variant depends on the load level of the resource dynamics and is formed as a resource request, which is sent to a local batch-job management system.
暂无评论