Home About us Contact
|
Home About us Contact | ||
|
|
||
Performance Results (performance + result)
Selected AbstractsFactors affecting the performance of parallel mining of minimal unique itemsets on diverse architecturesCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 9 2009D. J. Haglin Abstract Three parallel implementations of a divide-and-conquer search algorithm (called SUDA2) for finding minimal unique itemsets (MUIs) are compared in this paper. The identification of MUIs is used by national statistics agencies for statistical disclosure assessment. The first parallel implementation adapts SUDA2 to a symmetric multi-processor cluster using the message passing interface (MPI), which we call an MPI cluster; the second optimizes the code for the Cray MTA2 (a shared-memory, multi-threaded architecture) and the third uses a heterogeneous ,group' of workstations connected by LAN. Each implementation considers the parallel structure of SUDA2, and how the subsearch computation times and sequence of subsearches affect load balancing. All three approaches scale with the number of processors, enabling SUDA2 to handle larger problems than before. For example, the MPI implementation is able to achieve nearly two orders of magnitude improvement with 132 processors. Performance results are given for a number of data sets. Copyright © 2009 John Wiley & Sons, Ltd. [source] Performance analysis of the IEEE 802.11 MAC protocol for wireless LANsINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6 2005P. Chatzimisios Abstract Wireless local area networks (WLANs) are extremely popular being almost everywhere including business, office and home deployments. The IEEE 802.11 protocol is the dominating standard for WLANs. The essential medium access control (MAC) mechanism of 802.11 is called distributed co-ordination function (DCF). This paper provides a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay, the packet drop probability and the average time to drop a packet for both basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. We demonstrate that a Markov chain model presented in the literature, which also calculates throughput and packet delay by introducing an additional transition state to the Markov chain model, does not appear to model IEEE 802.11 correctly, leading to ambiguous conclusions for its performance. We also carry out an extensive and detailed study on the influence on performance of the initial contention window size (CW), maximum CW size and data rate. Performance results are presented to identify the dependence on the backoff procedure parameters and to give insights on the issues affecting IEEE 802.11 DCF performance. Copyright © 2005 John Wiley & Sons, Ltd. [source] Mental rotation delays the heart beat: Probing the central processing bottleneckPSYCHOPHYSIOLOGY, Issue 5 2003J. Richard Jennings Abstract We tested the hypothesis that mental rotation would delay response-related processing as indicated by transient slowing of the heart beat. Thirty college-age subjects (half female) were presented with normal and mirror image letters rotated at 0, 60, 120, and 180°. Three letters were assigned to a right-hand response; a separate three to a left-hand response. Responses were only required for letters in one orientation, mirror or normal. Continuous measures of interbeat interval (IBI) of the heart, respiration, and muscle tension were collected. Performance results were largely consistent with prior findings. Greater angular displacement of the stimuli was associated with greater lengthening of IBI immediately after the stimulus. IBI was influenced equally by angle of rotation in respond and inhibit trials. The lengthening of IBI was interpreted as due to a delay in response selection and execution due to mental rotation. [source] First experience of compressible gas dynamics simulation on the Los Alamos roadrunner machineCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 17 2009Paul R. Woodward Abstract We report initial experience with gas dynamics simulation on the Los Alamos Roadrunner machine. In this initial work, we have restricted our attention to flows in which the flow Mach number is less than 2. This permits us to use a simplified version of the PPM gas dynamics algorithm that has been described in detail by Woodward (2006). We follow a multifluid volume fraction using the PPB moment-conserving advection scheme, enforcing both pressure and temperature equilibrium between two monatomic ideal gases within each grid cell. The resulting gas dynamics code has been extensively restructured for efficient multicore processing and implemented for scalable parallel execution on the Roadrunner system. The code restructuring and parallel implementation are described and performance results are discussed. For a modest grid size, sustained performance of 3.89 Gflops,1 CPU-core,1 is delivered by this code on 36 Cell processors in 9 triblade nodes of a single rack of Roadrunner hardware. Copyright © 2009 John Wiley & Sons, Ltd. [source] Channel estimation methods for preamble-based OFDM/OQAM modulations,EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 7 2008C. Lélé In this paper, OFDM/OQAM is proposed as an alternative to conventional OFDM with cyclic prefix (CP) for transmission over multi-path fading channels. Two typical features of the OFDM/OQAM modulation are the absence of a guard interval (GI) and the fact that the orthogonality property only holds in the real field and for a distortion-free channel. Thus, the classical channel estimation (CE) methods used for OFDM cannot be directly applied to OFDM/OQAM. Therefore, we propose an analysis of the transmission of an OFDM/OQAM signal through a time-varying multi-path channel and we derive two new CE methods. The first proposed method only requires the use of pair of real pilots (POP). In a second method, named interference approximation method (IAM), we show how the imaginary interference can be used to improve the CE quality. Several preamble variants of the IAM are compared with respect to the resulting instantaneous power. Finally, the performance results obtained for the transmission of an OFDM/OQAM signal through an IEEE 802.22 channel using the POP method and three variants of IAM are compared to those obtained with CP-OFDM. Copyright © 2008 John Wiley & Sons, Ltd. [source] A new traffic model for backbone networks and its application to performance analysisINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6 2008Ming Yu Abstract In this paper, we present a new traffic model constructed from a random number of shifting level processes (SLP) aggregated over time, in which the lengths of the active periods of the SLP are of Pareto or truncated Pareto distribution. For both cases, the model has been proved to be asymptotically second-order self-similar. However, based on extensive traffic data we collected from a backbone network, we find that the active periods of the constructing SLPs can be approximated better by a truncated Pareto distribution, instead of the Pareto distribution as assumed in existing traffic model constructions. The queueing problem of a single server fed with a traffic described by the model is equivalently converted to a problem with a traffic described by Norros' model. For the tail probability of the queue length distribution, an approximate expression and upper bound have been found in terms of large deviation estimates and are mathematically more tractable than existing results. The effectiveness of the traffic model and performance results are demonstrated by our simulations and experimental studies on a backbone network. Copyright © 2007 John Wiley & Sons, Ltd. [source] Layered coding for satellite-plus-terrestrial multipath correlated fading channelsINTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 5 2004A. Levissianos Abstract This paper introduces two alternative layered-coding (LC) structures suitable for a combination of a geostationary (GEO) satellite and a terrestrial system providing multicasting multimedia services. Both schemes include a RAKE receiver and their performance results are presented under realistic satellite and terrestrial channel conditions. The structures are based on mapping the coded bits either onto 8-PSK symbols or onto QPSK symbols. The LC parameters (such as the interleaver design and the convolutional encoder structures) are analysed and their effect on performance is quantified, especially in cases of highly correlated channels (low vehicular speeds). The various impairments that are associated to the transmission through both terrestrial and satellite correlated fading channels will be taken into account and link level performance results as well as a complexity discussion will be presented. Copyright © 2004 John Wiley & Sons, Ltd. [source] A Generalized Extreme Value Approach to Financial Risk MeasurementJOURNAL OF MONEY, CREDIT AND BANKING, Issue 7 2007TURAN G. BALI financial risk management; value at risk; extreme value theory; skewed fat-tailed distributions This paper develops an unconditional and conditional extreme value approach to calculating value at risk (VaR), and shows that the maximum likely loss of financial institutions can be more accurately estimated using the statistical theory of extremes. The new approach is based on the distribution of extreme returns instead of the distribution of all returns and provides good predictions of catastrophic market risks. Both the in-sample and out-of-sample performance results indicate that the Box,Cox generalized extreme value distribution introduced in the paper performs surprisingly well in capturing both the rate of occurrence and the extent of extreme events in financial markets. The new approach yields more precise VaR estimates than the normal and skewed t distributions. [source] | ||||||||||