Results 1 - 10 of 39,274

Table 1. Categorization of content distribution schemes

in Content Distribution for Publish/Subscribe Services
by Mao Chen, Andrea Lapaugh, Jaswinder Pal Singh 2003
"... In PAGE 9: ...4 Summary of Strategies The above caching and content delivery approaches can be classified based on when and how content is delivered from the publisher to a proxy server. Table1 categorizes all the approaches discussed in this paper. Table 1.... ..."
Cited by 4

Table 3: Distributed hybrid schemes

in Garbage Collecting The Internet
by Saleh E. Abdullahi, Graem A. Ringwood

Table 2. Compression and distribution schemes for two-dimensional arrays

in Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90
by Rong-guey Chang, Tyng-Ruey Chuang 2001
"... In PAGE 5: ... The compression schemes being considered are Compressed Row Storage (CRS), Compressed Column Storage (CCS), and dense representations. Table2 lists the compression and distribution schemes for sparse matrices. Note that by (*, Block) scheme, we mean distributing the sparse matrix by row in a two-dimensional array.... ..."
Cited by 3

Table 3.3: An example profile for illustrating data distribution schemes.

in FOR THE DEGREE OF
by Wen-chih Peng, Advisor Prof, Ming-syan Chen, Wen-chih Peng 2001

Table 3: service distribution in WPE scheme

in
by unknown authors
"... In PAGE 3: ... Following WPE scheme, we calculate vi;WPE(t), k;T i (t) and stampk i;WPE (or k;T i;norm(t) at given instant t which, in fact, represents the starting time of a packet slot) and select a packet from the ses- sion having the minimum stamp value at that instant. Table3... ..."

Table 4. The impact of various net distribution schemes with best algorithm for detailed pin distribution.

in Global Routing Paradigm for System-on-Package
by Jacob Minz , Mohit Pathak, Sung Kyu Lim
"... In PAGE 6: ... The results show that DPD achieves the lowest wirelength for all circuits, while also decreasing the number of layers. In Table4 , we study how the number of routing layers and wirelength (WL) change with various Net Distribution approaches. We used very simple heuristics such as assigning all i-nets to the routing interval above its floorplan (RUP) and below its floorplan (RD).... ..."

Table 1. The domains for distribution/compression scheme selections

in CONCURRENCY: PRACTICE AND EXPERIENCE, VOL. 9(11), 1101–1111 (NOVEMBER 1997) Towards automatic support of parallel sparse computation in Java with continuous compilation
by Rong-guey Chang, Cheng-wei Chen, Tyng-ruey Chuang, Jenq, Kuen Lee
"... In PAGE 3: ... The com- pression schemes being considered are CRS, CCS and dense representations. Table1 lists the compression and distribution schemes for distributed sparse matrices. Note that by (Block, *) scheme, we mean distributing the sparse matrix by row.... ..."

Table 1: Isoe ciency functions for di erent work-distribution schemes and architectures.

in Parallel Depth First Search, Part II: Analysis
by Vipin Kumar, V. Nageshwara Rao 1987
"... In PAGE 21: ...hared-memory/!-network-with-message-combining architecture (e.g., RP3) which has bet- ter performance than previously known algorithms. Table1 shows isoe ciency functions for di erent architectures and work-distribution schemes. Much of the analysis presented in this paper is applicable to other parallel formulations in which work is shared dynamically among several processors (e.... ..."
Cited by 28

Table 1 : Comparative summary of different self-healing key distribution schemes in the j-th session

in Constant Storage Self-Healing Key Distribution with Revocation in Wireless Sensor Network
by Ratna Dutta, Yong Dong, Wu Sourav Mukhopadhyay
"... In PAGE 6: ... Efficiency We now compare our protocol with the other similar schemes. Table1 compares storage and communication com- plexity of our proposed scheme with the previous approaches. The storage requirement in our scheme comes from Setup phase and after receiving the session key distribution message.... ..."

Table 1: Distributed indirect identi cation schemes

in Garbage Collecting The Internet
by Saleh E. Abdullahi, Graem A. Ringwood
"... In PAGE 21: ...3 Indirect Identi cation of Distributed Garbage Mohammed-Ali [1984] describes a number of variations of distributed mark-scan collectors. The simplest, sequential mark-scan, (referred to as [Mohammed-Ali, 1984a] in Table1 ), is not a serious contender but a point of departure for two improved versions. These di erent versions are used to explain the evolution of indirect identi cation distributed garbage collectors.... ..."
Results 1 - 10 of 39,274