Interkoneksi Dan Pembangunan E-govt

The background of this study is interconnection phenomenon that has hardly examined. This one focuses on questioning the network interconnection structure application in the public service, including e-govt. The results show that Interconnection network structure has been already adopted. The ability of computer radius between computers is 5-10 km, with 10-100 Mbps bandwitch, with LAN Network Interconnection Structure. Router and gateway are already interconnected, except LAN. In overall, LAN is the network structure with related phenomenon, the stage of e-gov adopted in goverment, variants of 12 question was done in the development of e-govt agencies context. There are 3 that adopted: information site creation, human resources preparation, and internal dissemination of information sites. The level of e-govt development phase are divided into 4: preparation, maturation, consolidation and utilization. But generally, the level is in the preparation phase. The public has not be able to enjoy public service. The condition is not favorable to the public caused by a number factors of humanity (such as culture of sharing-sharring the information; culture of documentation). This increased interconnection implementation related and e-govt ahead requires an urgence of implementation of socializing and technical guidance related to implementation of interconnection and e-govt in the Government apparatus

On (2,2)-Domination in Hexagonal Mesh Pyramid

Network topology plays a key role in designing an interconnection network. Various topologies for interconnection networks have been proposed in the literature of which pyramid network is extensively used as a base for both software data structure and hardware design. The pyramid networks can efficiently handle the communication requirements of various problems in graph theory due to its inherent hierarchy at each level. Domination problems are one of the classical types of problems in graph theory with vast application in computer networks and distributed computing. In this paper, we obtain the bounds for a variant of the domination problem namely (2,2)-domination for a pyramid network called Hexagonal mesh pyramid

Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube (RH) parallel computers

The binary hypercube parallel computer has been very popular due to its rich interconnection structure and small average internode distance which allow the efficient embedding of frequently used topologies. Communication patterns of many parallel algorithms also match the hypercube topology. The hypercube has high VLSI complexity. however. due to the logarithmic increase in the number of connections to each node with the increase in the number of dimensions of the hypercube. The reduced hypercube (RH) interconnection network. which is obtained by a uniform reduction in the number of links for each hypercube node. yields lower-complexity interconnection networks when compared to hypercubes with the same number of nodes. It has been shown elsewhere that the RH interconnection network achieves performance comparable to that of the hypercube. at lower hardware cost. The reduced VLSI complexity of the RH also permits the construction of larger systems. thus. making the RH suitable for massively parallel processing. This thesis proposes algorithms for data broadcasting and reduction. prefix computation, and sorting on the RH parallel computer. All these operations are fundamental to many parallel algorithms. A worst case analysis of each algorithm is given and compared with equivalent- algorithms for the regular hypercube. It is shown that the proposed algorithms for the RH yield performance comparable to that for the regular hypercube

Multistage interconnection networks : improved routing algorithms and fault tolerance

Multistage interconnection networks for use by multiprocessor systems are optimal in terms of the number of switching element, but the routing algorithms used to set up these networks are suboptimal in terms of time. The network set-up time and reliability are the major factors to affect the performance of multistage interconnection networks. This work improves routing on Benes and Clos networks as well as the fault tolerant capability. The permutation representation is examined as well as the Clos and Benes networks. A modified edge coloring algorithm is applied to the regular bipartite multigraph which represents a Clos network. The looping and parallel looping algorithms are examined and a modified Tree-Connected Computer is adopted to execute a bidirectional parallel looping algorithm for Benes networks. A new fault tolerant Clos network is presented