Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
28,774
Table 1. BB state scalability
"... In PAGE 4: ... The reservation rates varied over the duration of the experiment, based on the rate profile originated from the traced data. Table1 shows the number of state messages that a BB (the BB of T 1inthis experiment) maintains in case of SIBBS and eSIBBS. The table shows that a BB can be a potential bottleneck in case of SIBBS when the number of source- destination pairs are large.... ..."
Table 4. Parallel Scalability.
"... In PAGE 7: ... Grid Refinement. To test the scalability of the simulator we compare the run time for three di erent grids in Table4 . Starting with the 400 400 grid run on two processors, we simultaneously quadruple the number of unknowns and the number of processors used to run the simu- lation.... In PAGE 7: ... Starting with the 400 400 grid run on two processors, we simultaneously quadruple the number of unknowns and the number of processors used to run the simu- lation. For the simulator to scale well, the run times should be approximately constant, and in Table4 one can see that this is the case. Thus, this simulator scales well as the... ..."
Table 2 presents a broader comparison with other architectures. We have included only those FPGA solutions that are either scalable [9, 10] or that are believed to be the state of the art in ECC hardware implementations. We give this comparison as a proof that a scalable and side-channel secure design can also lead to a solution that is competitive in perfor- mance.
in Side-channel aware design: Algorithms and architectures for elliptic curve cryptography over GF(2 n
2005
"... In PAGE 5: ...Table2 . Comparison with other rel.... ..."
Cited by 2
Table 1: Microkernel layers
1976
"... In PAGE 5: ... 3.2 The Microkernel Table1 shows the minimal set of abstractions in a microkernel. The microkernel contains no le or directory system, o ers no remote procedure call, and may even require some of the memory management to be performed in user mode.... In PAGE 26: ... (No e ect for input device.) Table1 0: Interface for devices (level 6)... In PAGE 27: ... (Fails if the open pipe does not permit writing.) Table1 1: Interface for pipes (level 6)... In PAGE 29: ... (Fails if the directory ac- cess codes prohibit changes.) Table1 2: Speci cation of a directory manager interface (level 7)... In PAGE 33: ... SEND(handle, event) Send an event to the given window. Table1 3: Graphics Server(level 9)... ..."
Cited by 18
Table 1: Microkernel layers
1976
"... In PAGE 5: ... 3.2 The Microkernel Table1 shows the minimal set of abstractions in a microkernel. The microkernel contains no le or directory system, o ers no remote procedure call, and may even require some of the memory management to be performed in user mode.... In PAGE 26: ... (No e ect for input device.) Table1 0: Interface for devices (level 6)... In PAGE 27: ... (Fails if the open pipe does not permit writing.) Table1 1: Interface for pipes (level 6)... In PAGE 29: ... (Fails if the directory ac- cess codes prohibit changes.) Table1 2: Speci cation of a directory manager interface (level 7)... In PAGE 33: ... SEND(handle, event) Send an event to the given window. Table1 3: Graphics Server(level 9)... ..."
Cited by 18
Table 1: Approximate Security, Manageability and Scalability Ratings for PCN/SCADA Segregation Architectures
2005
"... In PAGE 24: ... Two zone firewall-based designs without a DMZ (Architectures 4 and 5) 3. Three zone firewall-based designs with a DMZ (Architectures 6, 7 and 8) In Table1 we have summarized our ratings of security, manageability and scalability for each of the eight segregation architectures, while Figure 10 shows the same information in a graphical format. It is important to note that these ratings are approximate only and are based on the assumptions that only technologies that are widely available at the time of the report are used and that they are deployed in typical configurations.... ..."
Table 1: Monad transformers
1994
"... In PAGE 10: ... Applying two (di erent) environment monad transformers to the identity monad indeed yields the double environment monad. Other monad transformers are listed in Table1 . Notice that composition of transformers is not commutative.... In PAGE 13: ... Levels may have multiple names because conceptually distinct levels may coincide. For instance, level 6 of Table1 is known to store constructs as stores and to environment constructs as env-results. Of course, distinct levels must have distinct names.... ..."
Cited by 5
Table 11 Strong Monads
"... In PAGE 42: ...) Now a ?-autonomous category with ( nite and nullary) products and co- products (one implies the other because of the duality) is a model of classical linear logic; for convenience, we call the product N and the coproduct . We add to this the following: Definition 13 (Strong Monads) A strong monad is a monad h ( ); ; i on C, together with a natural transformation : ( ) ! ( ) such that the diagrams in Table11 commute.... In PAGE 48: ... The top diagram, for example, expresses the equality A A = A A; now the rst is given by the proof Ax A A ` A R A ` A L A ` A L A ` A A A ` A cut A ` A whereas the second is given by the proof AxA A ` A R A ` A L A ` A L A ` A R A ` A L A ` A A A ` A cut A ` A We want these two proofs to be equal. We need similar equalities for the other diagrams in Table11 , and for the other diagrams de ning a ?-autonomous category. With this de nition of equality between proofs, then, we have de ned a category, F, in which the objects are linear logic formulae and in which the morphisms are proofs of entailments.... In PAGE 50: ...and y commutes because of the bottom diagram in Table11 . (The small triangles commute by de nition.... ..."
Results 1 - 10
of
28,774
