Automated Selection of Software Refactorings that Improve Performance

2018 ◽  
Author(s):  
Nikolai Moesus ◽  
Matthias Scholze ◽  
Sebastian Schlesinger ◽  
Paula Herber
Keyword(s):  
Improve Performance ◽  
Selection Of

The Use of Individualized Voices for Multi-Agent Speech Displays

2016 ◽  
Vol 60 (1) ◽  
pp. 1545-1549
Author(s):  
Clayton D. Rothwell ◽  
Griffin D. Romigh ◽  
Brian D. Simpson ◽  
Eric R. Thompson
Keyword(s):  
Episodic Memory ◽  
Speech Communication ◽  
Acoustic Features ◽  
Improve Performance ◽  
Dialog Systems ◽  
Voiced Speech ◽  
Multi Agent ◽  
Purposeful Selection ◽  
Lexical Content ◽  
Selection Of

Listeners can use vocal features of speech to help segregate a target talker from a field of different- voiced speech maskers. However, recent research also suggests that acoustic features (such as those responsible for identity) are stored with speech’s lexical content in episodic memory and can be beneficial in some non-overlapping speech perception tasks as well (e.g., Goldinger, 1996). This paired-voice benefit may have implications for speech displays and dialog systems since purposeful selection of the speaker’s voice is possible, unlike in most live speech communication tasks. In the current experiments, we investigated if manipulating voice identity could improve performance in three complex listening situations relevant to speech displays: extraction of information from background speech, listening while simultaneously speaking, and keeping track of multiple agents’ states. Results indicate that the benefits of individualized voices seen in the episodic memory literature do not translate to the current, more complex, speech tasks.

A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers

2015 ◽  
Vol 8 (4) ◽  
pp. 57-75 ◽  
Author(s):  
Saad Bani-Mohammad ◽  
Ismail M. Ababneh ◽  
Mohammad Yassen
Keyword(s):  
Performance Improvement ◽  
Communication Overhead ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
Improve Performance ◽  
Simulation Experiments ◽  
Extensive Simulation ◽  
System Utilization ◽  
Selection Of ◽  
Allocation Strategies

In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is likely to increase. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Compacting Non-Contiguous Processor Allocation Strategy (CNCPA), is suggested for the 2D mesh multicomputers. In the proposed strategy, a job is compacted into free locations. The selection of the free locations has for goal leaving large free sub-meshes in the system. To evaluate the performance improvement achieved by the proposed strategy and compare it against well-known existing non-contiguous allocation strategies, the authors conducted extensive simulation experiments. The results show that the proposed strategy can improve performance in terms of job turnaround times and system utilization.

scholarly journals Using PRRSV-Resilient Sows Improve Performance in Endemic Infected Farms with Recurrent Outbreaks

Animals ◽  
2021 ◽  
Vol 11 (3) ◽  
pp. 740
Author(s):  
Gloria Abella ◽  
Adela Pagès-Bernaus ◽  
Joan Estany ◽  
Ramona Natacha Pena ◽  
Lorenzo Fraile ◽  
...  
Keyword(s):  
Simulation Model ◽  
Production Cost ◽  
Discrete Event ◽  
Reproductive Parameters ◽  
Productive Performance ◽  
Improve Performance ◽  
Gross Margin ◽  
Event Based ◽  
Improve Disease Control ◽  
Selection Of

The selection of porcine reproductive and respiratory syndrome (PRRS) resilient sows has been proposed as a strategy to control this disease. A discrete event-based simulation model was developed to mimic the outcome of farms with resilient or susceptible sows suffering recurrent PRRSV outbreaks. Records of both phenotypes were registered in a PRRSV-positive farm of 1500 sows during three years. The information was split in the whole period of observation to include a PRRSV outbreak that lasted 24 weeks (endemic/epidemic or En/Ep) or only the endemic phase (En). Twenty simulations were modeled for each farm: Resilient/En, Resilient/En_Ep, Susceptible/En, and Susceptible/En_Ep during twelve years and analyzed for the productive performance and economic outcome, using reference values. The reproductive parameters were generally better for resilient than for susceptible sows in the PRRSV En/Ep scenario, and the contrary was observed in the endemic case. The piglet production cost was always lower for resilient than for susceptible sows but showed only significant differences in the PRRSV En/Ep scenario. Finally, the annual gross margin by sow is significantly better for resilient than for susceptible sows for the PRRSV endemic (12%) and endemic/epidemic scenarios (17%). Thus, the selection of PRRSV resilient sows is a profitable approach for producers to improve disease control.

THE INTERACTION AND RELATIVE EFFECTIVENESS OF HARDWARE AND SOFTWARE DATA PREFETCH

2012 ◽  
Vol 21 (02) ◽  
pp. 1240002
Author(s):  
SANTHOSH VERMA ◽  
DAVID M. KOPPELMAN
Keyword(s):  
Relative Effectiveness ◽  
The Other ◽  
Data Cache ◽  
Improve Performance ◽  
Code Analysis ◽  
Average Analysis ◽  
Hardware Prefetching ◽  
Access Patterns ◽  
Compiler Techniques ◽  
Selection Of

A major performance limiter in modern processors is the long latencies caused by data cache misses. Both compiler- and hardware-based prefetching schemes help hide these latencies and so improve performance. Compiler techniques infer memory access patterns through code analysis, and insert appropriate prefetch instructions. Hardware prefetching techniques work independently from the compiler by monitoring an access stream, detecting patterns in this stream and issuing prefetches based on these patterns. This paper looks at the interplay between compiler and hardware architecture-based prefetching techniques. Does either technique make the other one unnecessary? First, compilers' ability to achieve good results without extreme expertise is evaluated by preparing binaries with no prefetch, one-flag prefetch (no tuning), and expertly tuned prefetch. From runs of SPECcpu2006 binaries, we find that expertise avoids minor slowdown in a few benchmarks and provides substantial speedup in others. We compare software schemes to hardware prefetching schemes and our simulations show software alone substantially outperforms hardware alone on about half of a selection of benchmarks. While hardware matches or exceeds software in a few cases, software is better on average. Analysis reveals that in many cases hardware is not prefetching access patterns that it is capable of recognizing, due to some irregularities in the observed miss sequence. Hardware outperforms software on address sequences that the compiler would not guess. In general, while software is better at prefetching individual loads, hardware partly compensates for this by identifying more loads to prefetch. Using the two schemes together provides further benefits, but less than the sum of the contributions of each alone.

scholarly journals Automated Selection of Software Refactorings that Improve Performance

2018 ◽  
Author(s):  
Nikolai Moesus ◽  
Matthias Scholze ◽  
Sebastian Schlesinger ◽  
Paula Herber
Keyword(s):  
Improve Performance ◽  
Selection Of

scholarly journals Motivation Improves Working Memory by Two Processes: Prioritisation and Retrieval Thresholds

2021 ◽  
Author(s):  
John P Grogan ◽  
Govind Randhawa ◽  
Minho Kim ◽  
Sanjay G Manohar
Keyword(s):  
Working Memory ◽  
Memory Capacity ◽  
Memory Recall ◽  
Improve Performance ◽  
Trade Offs ◽  
The Cost ◽  
Memory Precision ◽  
Speed Accuracy ◽  
Selection Of ◽  
Attention Shifts

Motivation can improve performance when the potential rewards outweigh the cost of effort expended. In working memory (WM), people can prioritise rewarded items at the expense of unrewarded items, suggesting a fixed memory capacity. But can capacity itself increase with motivation? Across four experiments (N = 30-34) we demonstrate motivational improvements in WM even when all items were rewarded. However, this was not due to better memory precision, but rather better selection of the probed item within memory. Motivational improvements operated independently of encoding, maintenance, or attention shifts between items in memory. Moreover, motivation slowed responses. This contrasted with the benefits of rewarding items unequally, which allowed prioritisation of one item over another. We conclude that motivation can improve memory recall, not via precision or capacity, but via speed-accuracy trade-offs when selecting the item to retrieve.

scholarly journals PERBANDINGAN FASTETHERNET , GIGABITETHERNET DAN SERIAL DALAM JARINGAN BERBASIS ROUTING PROTOKOL EIGRP

2017 ◽  
Author(s):  
Oris Krianto Sulaiman ◽  
Adi Widarma
Keyword(s):  
Routing Protocol ◽  
Large Scale ◽  
Network Performance ◽  
Computer Network ◽  
Network Access ◽  
Improve Performance ◽  
Technological Developments ◽  
Increasing Demand ◽  
Large Scale Networks ◽  
Selection Of

Technological developments in the computer network gradually grew rapidly along with the increasing demand for network access that is efficient, stable and fast . One of the factors that affect the speed of the network is to use ethernet and a serial technology in which each of these technologies has its own characteristics to improve performance in the network. This technology is supported by a good network design . In large-scale networks is needed a high ability to improve network performance , EIGRP routing protocol enables improved network performance effectively where one of them for ethernet and serial technologies . Selection of Ethernet and serial technologies within EIGRP routing protocol would greatly assist in improving the performance of the network , with the calculation of EIGRP metric to compare which technology is better in the EIGRP routing protocol.

Sign in / Sign up

Export Citation Format

Share Document