1,720,969 research outputs found
Tuning the continual flow pipeline architecture with virtual register renaming
No full textContinual Flow Pipelines (CFPs) allow a processor core to process hundreds of in-flight instructions without increasing cycle-critical pipeline resources. When a load misses the data cache, CFP checkpoints the processor register state and then moves all miss-dependent instructions into a low-complexity WB to unblock the pipeline. Meanwhile, miss-independent instructions execute normally and update the processor state. When the miss data return, CFP replays the miss-dependent instructions from the WB and then merges the miss-dependent and miss-independent execution results. CFP was initially proposed for cache misses to DRAM. Later work focused on reducing the execution overhead of CFP by avoiding the pipeline flush before replaying miss-dependent instructions and executing dependent and independent instructions concurrently. The goal of these improvements was to gain performance by applying CFP to L1 data cache misses that hit the last level on chip cache. However, many applications or execution phases of applications incur excessive amount of replay and-or rollbacks to the checkpoint. This frequently cancels benefits from CFP and reduces performance. In this article, we improve the CFP architecture by using a novel virtual register renaming substrate and by tuning the replay policies to mitigate excessive replays and rollbacks to the checkpoint. We describe these new design optimizations and show, using Spec 2006 benchmarks and microarchitecture performance and power models of our design, that our Tuned-CFP architecture improves performance and energy consumption over previous CFP architectures by ∼10percent and ∼8percent, respectively. We also demonstrate that our proposed architecture gives better performance return on energy per instruction compared to a conventional superscalar as well as previous CFP architectures. © 2014 ACM.Agarwal V, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P248, DOI 10.1109-ISCA.2000.854395; Akkary H, 2003, P 36 ANN INT S MICR, P423, DOI 10.1109-MICRO.2003.1253246; Akkary H., 2004, ACM T ARCHIT CODE OP, V1, P418, DOI 10.1145-1044823.1044826; Barnes RD, 2003, 36TH INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, PROCEEDINGS, P387; BARNES RD, 2005, P 38 ANN INT S MICR, P319; Brooks D., 2000, P 27 ANN INT S COMP, V28, P83; Chaudhry S, 2009, CONF PROC INT SYMP C, P484; Chrysos GZ, 1998, CONF PROC INT SYMP C, P142; Cristal A., 2002, UPCDAC200239 DEP COM; Cristal A., 2004, ACM T ARCHIT CODE OP, V1, P389, DOI 10.1145-1044823.1044825; Cristal A., 2004, Proceedings. 10th International Symposium on High Performance Computer Architecture; Dundas J., 1997, P 1997 ACM INT C SUP, P68, DOI 10.1145-263580.263597; Gandhi A, 2005, CONF PROC INT SYMP C, P446, DOI 10.1109-ISCA.2005.46; Gonzalez A., 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture (Cat. No.98TB100224), DOI 10.1109-HPCA.1998.650557; Hilton Andrew, 2010, P 1 INT WORKSH MOD S, P1, DOI 10.1145-1835980.1835983; Hilton Andrew, 2009, P 14 INT S HIGH PERF, P431; Hwu W. W., 1987, P 14 ANN INT S COMP, P18, DOI 10.1145-30350.30353; Jothi K, 2011, 2011 IEEE 29TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), P127, DOI 10.1109-ICCD.2011.6081387; Jothi Komal, 2013, P INT C SUP, P243; Jothi Komal, 2013, P 23 GREAT LAK S VLS, P43; Lebeck AR, 2002, CONF PROC INT SYMP C, P59; Manne S, 1998, CONF PROC INT SYMP C, P132; Martinez JF, 2002, INT SYMP MICROARCH, P3, DOI 10.1109-MICRO.2002.1176234; Mutlu O, 2005, CONF PROC INT SYMP C, P370, DOI 10.1109-ISCA.2005.49; Mutlu O., 2003, Proceedings the Ninth International Symposium on High-Performance Computer Architecture. HPCA-9 2003, DOI 10.1109-HPCA.2003.1183532; Mutlu Onur, 2005, COMPUTER ARCHITECTUR, V4, p[1, 2]; Nekkalapu S, 2008, PR IEEE COMP DESIGN, P384, DOI 10.1109-ICCD.2008.4751889; Papworth DB, 1996, IEEE MICRO, V16, P8, DOI 10.1109-40.491458; Sharafeddine M, 2012, ACM T ARCHIT CODE OP, V9, DOI 10.1145-2355585.2355592; Sharafeddine Mageda, 2013, P 26 INT C ARCH COMP, P86; Smith JE, 1995, P IEEE, V83, P1609, DOI 10.1109-5.476078; Srinivasan ST, 2004, ACM SIGPLAN NOTICES, V39, P107, DOI 10.1145-1037187.1024407; TOMASULO RM, 1967, IBM J RES DEV, V11, P25; Tullsen D. M., 1995, Proceedings 22nd Annual International Symposium on Computer Architecture (IEEE Cat. No.95CB35801), DOI 10.1109-ISCA.1995.524578; Wolff Sonya R., 2011, P 9 ANN WORKSH DUPL0
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
A Study on Linear Programming Problem
No full textGreen supply chain management GSCM is about incorporating the environmental idea in every stage of a supply chain. It has The LPP is the simplest way to calculate the profit and loss of a management. The important application of LPP is cost reduction in various business fields. It is also used to solve many diverse combination problems. LPP is more adaptive and flexible to analyze solution in various problems. Here we have discussed about the revenue and income of a hotel using LPP. The problem is solved using simplex method. The simplex method is easy to find the solution to the problem. Sempavazhaam D | Jothi K | Kamali S | Nandhini A | Princy Rebekah J "A Study on Linear Programming Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-2 , February 2019, URL: https://www.ijtsrd.com/papers/ijtsrd21539.pd
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
- …
