Titlebook: High Performance Computing Systems and Applications; Nikitas J. Dimopoulos,Kin F. Li Book 2002 Springer Science+Business Media New York 20

Ergots

RENIN

特別容易碎

Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Trafficunicast (or point-to-point) traffic. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the effect of collective communication algorithms on the network

RENAL

圣人

Analysis of Frame-Based Fair Queueing under Self-Similar Trafficueing (FFQ), a scheduling algorithm for packet switched networks, has been proposed. The algorithm has O(1) timestamp computation complexity. This makes the algorithm more practical for implementation in both general packet networks with variable packet sizes and in asynchronous transfer mode (ATM)

合適

Reducing Cache Miss Penalty Using I-Fetch Instructionsgives information of next basic block to be fetched. It is recognized by processor without decoding, and is processed in parallel with the other types of instructions. It is also used as the special instruction to prefech instructions. We call it the i-fetch instruction. Our simulation result shows

助記

Fatten

odel represents causal memory of the players, which are tokens on a Petri net and divided into two teams: the controllable system and the uncontrollable environment. For one environment player and a bounded number of system players, the problem of solving Petri games can be reduced to that of solvin

stress-test

refine