Cost Efficient Implementation of Multistage Symmetric Repackable Networks

Author(s):  
Amitabha Chakrabarty ◽  
Martin Collier

Symmetric rearrangeable networks (SRN) (Chakrabarty, Collier, & Mukhopadhyay, 2009) make efficient use of hardware, but they have the disadvantage of momentarily disrupting the existing communications during reconfiguration. Path continuity is a major issue in some application of rearrangeable networks. Using repackable networks (Yanga, Su, & Pin, 2008) is a solution to the path continuity problem in SRN. These networks provide functionality comparable to that of strict sense no blocking networks (SNB) but with minimum increase in the hardware than SRN. This paper proposes an efficient implementation of multistage symmetric repackable networks requiring optimum hardware cost than the method proposed in the literature. Cost optimization is achieved through the use of minimum number of bypass link(s). Investigated method works for networks built with more than three switching stages and shows promise of scalability.

Author(s):  
Amitabha Chakrabarty ◽  
Martin Collier

Symmetric rearrangeable networks (SRN) (Chakrabarty, Collier, & Mukhopadhyay, 2009) make efficient use of hardware, but they have the disadvantage of momentarily disrupting the existing communications during reconfiguration. Path continuity is a major issue in some application of rearrangeable networks. Using repackable networks (Yanga, Su, & Pin, 2008) is a solution to the path continuity problem in SRN. These networks provide functionality comparable to that of strict sense no blocking networks (SNB) but with minimum increase in the hardware than SRN. This paper proposes an efficient implementation of multistage symmetric repackable networks requiring optimum hardware cost than the method proposed in the literature. Cost optimization is achieved through the use of minimum number of bypass link(s). Investigated method works for networks built with more than three switching stages and shows promise of scalability.


2012 ◽  
Vol 205 (suppl 2) ◽  
pp. S169-S180 ◽  
Author(s):  
M. Schito ◽  
T. F. Peter ◽  
S. Cavanaugh ◽  
A. S. Piatek ◽  
G. J. Young ◽  
...  

Author(s):  
Jacob Girard ◽  
Andrew Gilbert ◽  
Daniel Lewis ◽  
Mary Spuches

This paper is concerned with minimizing the cost of self-assembling DNA nanostructures by minimizing the number of different components used in the construction. We first describe the nanostructures, then give a combinatorial formalization of the assembly process and demonstrate that the octet truss provides an accurate geometric framework for current branched junction molecule assembly. We choose the octet truss because it is highly symmetric and has an appropriate number of edges for the application. We develop a method of differentiating among branched junction molecules, the basic building blocks of the nanostructures, within this structure. In the mathematical model, we represent the branched junction molecules graphically with „tiles‟. We use this approach to find the minimum number of tiles necessary to construct Platonic and Archimedean solids naturally occurring within the octet truss. This will be useful and cost efficient for the chemists and biologists who actually build these branched junction molecules because once a branched junction molecule is created, a lab can make many copies of it.


2004 ◽  
Vol 37 (5) ◽  
pp. 159-165
Author(s):  
Petra Kohler ◽  
Florian Sarodnick ◽  
Tim Lum ◽  
Hartmut Scbulze ◽  
Siegmar Haasis ◽  
...  

2021 ◽  
Vol 12 (3) ◽  
pp. 48-63
Author(s):  
Arunambika T. ◽  
Senthil Vadivu P.

Many organizations require handling a massive quantity of data. The rapid growth of data in size leads to the demand for a new large space for storage. It is impossible to store bulk data individually. The data growth issues compel organizations to search novel cost-efficient ways of storage. In cloud computing, reducing an execution cost and reducing a storage price are two of several problems. This work proposed an optimal cost-effective data storage (OCEDS) algorithm in cloud data centres to deal with this problem. Storing the entire database in the cloud on the cloud client is not the best approach. It raises processing costs on both the customer and the cloud service provider. Execution and storage cost optimization is achieved through the proposed OCEDS algorithm. Cloud CSPs present their clients profit-maximizing services while clients want to reduce their expenses. The previous works concentrated on only one side of cost optimization (CSP point of view or consumer point of view), but this OCEDS reduces execution and storage costs on both sides.


Sign in / Sign up

Export Citation Format

Share Document