Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/689
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRabiei Mamat-
dc.date.accessioned2011-03-06T02:57:43Z-
dc.date.available2011-03-06T02:57:43Z-
dc.date.issued2004-01-
dc.identifier.urihttp://hdl.handle.net/123456789/689-
dc.description.abstractIn recent years, the rapid growth in the net traffics and on-line processing load has been significant, particularly in the area of database servers. Many factors are responsible for this growth, such as increasing demand to make information more available or accessible as well as increased information storage both in terms of size and volume. One solution is to resort to a cluster-based server. This however could indirectly increase the use of online applications and thus the demand for non-stop cluster servers. Hence, in designing a clustcr server, the main focus should be on providing highly reliable and good quality service servers. This is important since both hardware and software are failureconstraint. Thus, in preparing a reliable service, the cluster server must be able to maintain its reliability on some data replicas in addition to ensuring that all replicas have one permanent copy of the replica. This thesis proposed a replication technique known as "Neighbor Replica Distributed Technique", which is introduced to achieve a highly reliable service for a cluster server under four-node system.en_US
dc.language.isoenen_US
dc.publisherFakulti Sains dan Teknologien_US
dc.subjectQA 76.9 .D5 R3 2004en_US
dc.subjectRabiei Mamaten_US
dc.subjectA replica distribution technique for cluster server systemen_US
dc.subjectElectronic data processing -- Distributed processingen_US
dc.titleA replica distribution technique for cluster server systemen_US
dc.typeThesisen_US
Appears in Collections:Fakulti Sains dan Teknologi

Files in This Item:
File Description SizeFormat 
QA76.9 .D5 R3 2004 Abstract.pdf1.17 MBAdobe PDFView/Open
QA76.9 .D5 R3 2004.pdf
  Restricted Access
14.93 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.