Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
348
Minimizing internal speedup for performance guaranteed switches with optical fabrics
- IEEE/ACM Trans. Netw
, 2009
"... Abstract—We consider traffic scheduling in an packet switch with an optical switch fabric, where the fabric requires a reconfiguration overhead to change its switch configurations. To provide 100 % throughput with bounded packet delay, a speedup in the switch fabric is necessary to compensate for bo ..."
Abstract
-
Cited by 12 (8 self)
- Add to MetaCart
Abstract—We consider traffic scheduling in an packet switch with an optical switch fabric, where the fabric requires a reconfiguration overhead to change its switch configurations. To provide 100 % throughput with bounded packet delay, a speedup in the switch fabric is necessary to compensate
On the Stability of Input-Queued Switches with Speed-Up
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 2001
"... We consider cell-based switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports. In t ..."
Abstract
-
Cited by 70 (6 self)
- Add to MetaCart
We consider cell-based switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports
Optimal Speedup of Las Vegas Algorithms
- Information Processing Letters
, 1993
"... Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable. We consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follow ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
strategy. y Current address: International Computer Science Institute, 1947 Center Street, Berk...
On the Stability of Input-Buffer Cell Switches with Speed-up
- IEEE INFOCOM 2000, Tel Aviv
, 2000
"... We consider cell-based switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred towards output ports. The stability ..."
Abstract
-
Cited by 12 (4 self)
- Add to MetaCart
We consider cell-based switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred towards output ports
HIGH PERFORMANCE GPU SPEED-UP STRATEGIES FOR THE
"... This Presentation is brought to you for free and open access by the City College of New York at CUNY Academic Works. It has been accepted for inclusion in International Conference on Hydroinformatics by an authorized administrator of CUNY Academic Works. For more information, please ..."
Abstract
- Add to MetaCart
This Presentation is brought to you for free and open access by the City College of New York at CUNY Academic Works. It has been accepted for inclusion in International Conference on Hydroinformatics by an authorized administrator of CUNY Academic Works. For more information, please
Kismet: Parallel Speedup Estimates for Serial Programs
"... Software engineers now face the difficult task of refactoring serial programs for parallel execution on multicore processors. Currently, they are offered little guidance as to how much benefit may come from this task, or how close they are to the best possible parallelization. This paper presents Ki ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
Kismet, a tool that creates parallel speedup estimates for unparallelized serial programs. Kismet differs from previous approaches in that it does not require any manual analysis or modification of the program. This difference allows quick analysis of many programs, avoiding wasted engineering effort
Dependence Based Prefetching for Linked Data Structures
, 1998
"... We introduce a dynamic scheme that captures the access patterns of linked data structures and can be used to predict future accesses with high accuracy. Our technique exploits the dependence relationships that exist between loads that produce addresses and loads that consume these addresses. By iden ..."
Abstract
-
Cited by 179 (13 self)
- Add to MetaCart
. By identifying producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal. To achieve a prefetching effect, a small prefetch engine speculatively traverses this representation ahead of the executing program. Dependence-based prefetching achieves
An efficient program for many-body simulation
- SIAM J. Sci. and Stat. Comput
, 1985
"... Abstract. The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at the leaves and internal nodes labeled with the centers of mass of their de ..."
Abstract
-
Cited by 166 (0 self)
- Add to MetaCart
Abstract. The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at the leaves and internal nodes labeled with the centers of mass
Strategies of Post-entry Foreign Expansion: Speed-up or Slow-down?
"... This study explores the antecedents of the speed of post-entry foreign expansion in a host country. Employing competitive dynamics and organizational learning theories, the study examines the effect of competition, country-specific experience, and general international business experience on the tim ..."
Abstract
- Add to MetaCart
This study explores the antecedents of the speed of post-entry foreign expansion in a host country. Employing competitive dynamics and organizational learning theories, the study examines the effect of competition, country-specific experience, and general international business experience
Modeling Speedup of SPMD Applications on the Intel Paragon: A Case Study
- PROC. HIGH PERFORMANCE COMPUTING AND NETWORKING (HPCN '95
, 1995
"... Interconnection networks with nearly distance independent communication latency are a key feature of recent architectures. However, shared resources such as network channels can become bottlenecks that degrade performance and limit workload scalability. In this paper, the problem of network contenti ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
contention in medium scale multicomputers is addressed. A queueing network model that predicts application speedup on the Paragon is presented. The model has been experimentally validated under the SUNMOS operating system. The experimental and modeling results are in good agreement and suggest ways to avoid
Results 1 - 10
of
348
