• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,809
Next 10 →

Table 3: Snooping Bus Utilization for SVC

in Speculative Versioning Cache
by Sridhar Gopal Vijaykumar, Sridhar Gopal, T. N. Vijaykumar, James E. Smith, Gurindar S. Sohi 1998
"... In PAGE 23: ... For the SVC, an access is counted as a miss if data is supplied by the next level memory; data transfers between the L1 caches are not counted as misses. Table3 presents the bus utilization for the SVC. From these preliminary experiments, we make three observations: (i) the hit latency of data memory significantly affects ARB performance, (ii) the SVC trades-off hit rate for hit latency and the ARB trades-off hit latency for hit rate to achieve performance, and (iii) for the same total data storage, the SVC performs better than a contention-free ARB having a hit latency of 3 or more cycles.... ..."
Cited by 154

Table 3: Snooping Bus Utilization for SVC

in Speculative Versioning Cache
by Sridhar Gopal, T. N. Vijaykumar, James E. Smith, Gurindar S. Sohi 1998
"... In PAGE 23: ... For the SVC, an access is counted as a miss if data is supplied by the next level memory; data transfers between the L1 caches are not counted as misses. Table3 presents the bus utilization for the SVC. From these preliminary experiments, we make three observations: (i) the hit latency of data memory significantly affects ARB performance, (ii) the SVC trades-off hit rate for hit latency and the ARB trades-off hit latency for hit rate to achieve per- formance, and (iii) for the same total data storage, the SVC performs better than a contention-free ARB having a hit latency of 3 or more cycles.... ..."
Cited by 154

Table 3: Performance of baseline SVC

in Improving Instruction-Level Parallelism by Exploiting Global Value Locality
by Jian Huang, David J. Lilja 1998
"... In PAGE 13: ...2 Baseline SVC Performance The performance of the baseline SVC design described in Section 3.1 is summarized in Table3 . We see that this baseline implementation produces moderate speed-ups for Go, M88Ksim,andWordcount.... ..."
Cited by 6

Table 3: Performance of baseline SVC

in Improving Instruction-Level Parallelism by Exploiting Global Value Locality
by Jian Huang, David J. Lilja 1998
"... In PAGE 14: ...2 Baseline SVC Performance The performance of the baseline SVC design described in Section 3.1 is summarized in Table3 . We see that this baseline implementation produces moderate speed-ups for Go, M88Ksim, and Wordcount.... ..."
Cited by 6

Table 3: Performance of baseline SVC

in Improving Instruction-Level Parallelism by Exploiting Global Value Locality
by Jian Huang, David J. Lilja 1998
"... In PAGE 13: ...2 Baseline SVC Performance The performance of the baseline SVC design described in Section 3.1 is summarized in Table3 . We see that this baseline implementation produces moderate speed-ups for Go, M88Ksim, and Wordcount.... ..."
Cited by 6

Table 3: Performance of baseline SVC

in Improving Instruction-Level Parallelism by Exploiting Global Value Locality
by Jian Huang, David J. Lilja 1998
"... In PAGE 13: ...2 Baseline SVC Performance The performance of the baseline SVC design described in Section 3.1 is summarized in Table3 . We see that this baseline implementation produces moderate speed-ups for Go, M88Ksim,andWordcount.... ..."
Cited by 6

Table 2: Miss Ratios for ARB and SVC

in Speculative Versioning Cache
by Sridhar Gopal Vijaykumar, Sridhar Gopal, T. N. Vijaykumar, James E. Smith, Gurindar S. Sohi 1998
"... In PAGE 23: ... The configurations keep total data storage of the SVC and ARB/cache storage roughly the same, since the amount of ARB storage is rather modest compared to its data cache. The miss rates for the ARB and the SVC for a total storage of 32KB are shown in Table2 . For the SVC, an access is counted as a miss if data is supplied by the next level memory; data transfers between the L1 caches are not counted as misses.... ..."
Cited by 154

Table 2: Miss Ratios for ARB and SVC

in Speculative Versioning Cache
by Sridhar Gopal, T. N. Vijaykumar, James E. Smith, Gurindar S. Sohi 1998
"... In PAGE 23: ... The configurationskeep total data storage of the SVC and ARB/cache storage roughlythe same, since the amount of ARB storage is rather modest compared to its data cache. The miss rates for the ARB and the SVC for a total storage of 32KB are shown in Table2 . For the SVC, an access is counted as a miss if data is supplied by the next level memory; data transfers between the L1 caches are not counted as misses.... ..."
Cited by 154

Table 4. Event Table for SvcLight.

in Tools for Formal Specification, Verification, and Validation of Requirements
by Constance Heitmeyer, James Kirby, Bruce Labaw 1997
"... In PAGE 4: ... Like mode transition tables, event tables make explicit only those events that cause the variable defined by the table to change. Table4 is also an event table. It describes the controlled variable SvcLight as a function of the current mode and the variables SvcReset and SvcMiles.... ..."
Cited by 28

Table 1. SVC2004 participating teams

in SVC2004: First international signature verification competition
by Dit-yan Yeung, Hong Chang, Yimin Xiong, Susan George, Ramanujan Kashi, Takashi Matsumoto, Gerhard Rigoll 2004
"... In PAGE 2: ... All are academic teams from nine di erent countries (Australia, China, France, Germany, Korea, Sin- gapore, Spain, Turkey, and United States). Table1 shows all the participating teams, with nine decided to remain anonymous after the results were announced. Team 19 submitted three separate programs for each task based on di erent al- gorithms.... ..."
Cited by 5
Next 10 →
Results 1 - 10 of 8,809
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University