• 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 19,738
Next 10 →

Table 1. Beowulf Cluster Architectures

in Supporting High-Level Grid Parallel Programming: the Design and Implementation of Grid-GUM2
by A. D. Al Zain, P. W. Trinder, G. J. Michaelson, H-w. Loidl

TABLE XIV BEOWULF CLUSTER ARCHITECTURES

in Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
by unknown authors

Table 3: Comparison of dynamic clustered architectures.

in Approved by: ARCHITECTURAL ENHANCEMENTS FOR EFFICIENT OPERAND TRANSPORT IN MULTIMEDIA SYSTEMS
by Dr. D. Scott Wills, Dr. Hsien-hsin, S. Lee, Dr. Allen, R. Tannenbaum, Dr. Linda, M. Wills, Dr. Gabriel, H. Loh 2006
"... In PAGE 8: ... 12 Table 2: Execution model details for operand transport analysis. 19 Table3 : Comparison of dynamic clustered architectures. 36 Table 4: Common parameters and GENESYS results.... In PAGE 47: ... To eliminate critical latency from the front end of the pipeline, the clustered trace cache processor (CTCP) [7] assigns instructions at the commit (retire) stage by physically reordering instructions within a trace cache line so that they are issued directly to the desired clusters. Table3 summarizes important qualitative and quantitative characteristics of the dynamic clustered architectures described in this section. Note that Alpha 21264 decouples integer ... ..."

Table 1: Cluster nodes. Architecture PC

in Selection of Good Lattice Points Utilizing a Cluster
by Bernhard Hechenleitner, Karl Entacher

Table 6: The results of the mapping algorithm for a cluster architecture showing the cut-weight a67 , average

in Multilevel Mesh Partitioning for Heterogeneous Communication Networks
by C. Walshaw, M. Cross 2001
"... In PAGE 19: ... Tables 11 amp; 12 focus on a comparison of results for the cluster architecture and show average dilation, a232 , amp; cut-weight, a67 . As previously the rst column for each value of a5 shows the average dilation, a232a176a35 amp; cut-weight, a67a19a35 , respectively, for the combined partitioning/processor assignment algorithm, whilst the second column shows these gures scaled by the respective gures from Table6 , for the mapping algorithm (denoted a232 a44a43 amp; a67 a45a43 ). Thus for the crack mesh and a5a158a12a14a254 , the partitioning/processor assignment algorithm has average dilation 2.... ..."
Cited by 18

Table 5: Architecture evaluation cluster configurations Web

in Evaluating E-Commerce Cluster Architectures Using Simulation Return to:
by Andrew Boyer, Andrew Boyer 2004
"... In PAGE 30: ...ections 5.1 and 5.2 describe the workloads and the results. Each configuration contained nine machines: five web servers, two application servers, and two database servers. The machine assignments are listed in Table5 . The configurations used the default values for timeouts, polling intervals, queue lengths, and network capacity (two gigabits per second).... ..."

Table 6.1: LRAR architecture vs. clustered architecture a0a2a1a4a3

in CIP-DATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN
by Qin Zhao, Qin Zhao, Dr. Ir. B. Mesman

Table 11: The average dilation for processor assignment, A1D4, compared with that for mapping, A1D1, on a cluster architecture.

in Multilevel Mesh Partitioning for Heterogeneous Communication Networks
by C. Walshaw, M. Cross 2001
Cited by 18

Table 4. Specially configured architectures special

in Inter-cluster Communication Models for Clustered VLIW Processors
by Andrei Terechko, Erwan Le Thenaff, Manish Garg, Jos Van Eijndhoven, Henk Corporaal 2003
Cited by 16

Table 4. Results of cross validation, speed-up compared with 1-cluster architecture. The highlighted numbers refer to the performance of the excluded benchmark, when using the evolved sequence.

in Adapting Convergent Scheduling Using Machine-Learning
by Diego Puppin, Mark Stephenson, Saman Amarasinghe, Martin Martin, Una-May O'Reilly
"... In PAGE 12: ... The evolution was rerun excluding one of the seven benchmarks, and the result tested again on the excluded benchmark. In Table4 , the results are shown as speed-up compared with a one-cluster architecture. The seven cross-validation evolutions reached results very similar to the full evolution, for the excluded benchmarks too.... ..."
Next 10 →
Results 1 - 10 of 19,738
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