Free Essay

Operating System

In:

Submitted By aryanr
Words 5897
Pages 24
[Abbot1984]C.Abbot,"InterventionSchedulesfo rReal-TimeProgramming",
IEEETransactionsonSoftwareEngineering,VolumeSE-10,Number3(1984),pages
268-274.
[Accett aetal.1986 ]M.Accetta,R.Baron,W.Bolosky,D.B.Golub,R.Rashid,
A.Tevanian,andM.Young,"Mach:ANewKernelFoundationfo rUnix
Development",ProceedingsoftheSummerUSENIXConference(1986),pages
93-112.
[Agrawa landAbbadi1991]D.P.AgrawalandA.E.Abbadi,"AnEfficientand
Fault-TolerantSolutionofDistributedMutualExclusion",ACM Transactionson
ComputerSystems,Volume9,Number1(1991) ,pages1-20 .
[Agr e2003]P.E.Agre,"P2PandthePromiseofInternetEquality",Communica-tionsoftheACM,Volume46,Number2(2003) ,pages39-42.
[Ahituvetal.1987 ]N.Ahituv,Y.Lapid,andS.Neumann,"Processing
EncryptedData",CommunicationsoftheACM,Volume30,Number9(1987) , pages777-780. [Ahmed2000 ]I.Ahmed,"ClusterComputing:AGlanceatRecentEvents",IEEE
Concurrency,Volume8,Number1(2000) .
[Ak l1983]S.G.Akl,"DigitalSignatures:ATutorialSurvey",Computer,Volume
16 ,Number2(1983) ,pages15-24.
[AkyurekandSalem1993]S.AkyurekandK.Salem,"AdaptiveBlockRear-rangement" ,ProceedingsoftheInternationalConferenceonDataEngineering(1993), pages182-189. [Al t1993]H.Alt,"RemovableMediainSolaris",ProceedingsoftheWinter
USENIXConference(1993) ,pages281-287.
[Anderson1990 ]T.E.Anderson,"ThePerformanceofSpinLockAlternatives fo rShared-MoneyMultiprocessors",IEEETrans.ParallelDistrib.Syst.,Volume
1,Number1(1990) ,pages6-16.
[Andersonetal.1989 ]T.E.Anderson,E.D.Lazowska,andH.M.Levy,"The
PerformanceImplicationsofThreadManagementAlternativesfo rShared-855
85 6Bibliography
MemoryMultiprocessors",IEEETransactionsonComputers,Volume38,Number
12(1989),pages1631-1644.
[Andersonetal.1991]T.E.Anderson,B.N.Bershad,E.D.Lazowska,and
H.M.Levy,"SchedulerActivations:EffectiveKernelSupportforth eUser-Level
ManagementofParallelism",ProceedingsoftheACMSymposiumonOperating
SystemsPrinciples(1991),pages95-109.
[Andersonetal.1995]T.E.Anderson,M.D.Dahlin,J.M.Neefe,D.A.Patterson,
D.S.Roselli,andR.Y.Wang,"ServerlessNetworkFileSystems",Proceedingsof theACMSymposiumonOperatingSystems Principles(1995),pages109-126.
[Andersonetal.2000]D.Anderson,J.Chase,andA.Vahdat,"Interposed
RequestRoutingforScalableNetworkStorage",ProceedingsoftheFourthSympo-siumonOperatingSystemsDesignandImplementation(2000).
[AsthanaandFinkelstein1995]P.Asthanaan dB.Finkelstein,"Superdense
OpticalStorage",IEEESpectrum,Volume32,Number8(1995),pages25-31.
[Audsleyetal.1991]N.C.Audsley,A.Burns,M.F.Richardson,andA.J.
Wellings,"Har dReal-TimeScheduling:TheDeadlineMonotonicApproach",
ProceedingsoftheIEEEWorkshoponReal-TimeOperating SystemsandSoftware
(1991).
[Axelsson1999]S.Axelsson,"TheBase-RateFallacyandItsImplicationsfor
IntrusionDetection",ProceedingsoftheACMConferenceonComputerandCommu-nicationsSecurity(1999),pages1-7.
[BabaogluandMarzullo1993]O.BabaogluandK.Marzullo."Consistent
GlobalStatesofDistributedSystems:FundamentalConceptsandMechanisms",
pages55-96.Addison-Wesley(1993).
[Bach1987]M.J.Bach,TheDesignoftheUNIXOperatingSystem,PrenticeHall
(1987).
[Backetal.2000]G.Back,P.Tullman,L.Stoller,W.C.Hsieh,andJ.Lepreau,
"TechniquesfortheDesignofJavaOperatingSystems",2000USENIXAnnual
TechnicalConference(2000).
[Bakeretal.1991]M.G.Baker,J.H.Hartman,M.D.Kupfer,K.W.Shirriff,and
J.K.Ousterhout,"MeasurementsofaDistributedFileSystem",Proceedingsofthe
ACMSymposiumonOperatingSystems Principles(1991),pages198-212.
[Balakrishnanetal.2003]H.Balakrishnan,M.F.Kaashoek,D.Karger,R.Mor-ris,andI.Stoica,"LookingUpDatainP2PSystems",CommunicationsoftheACM,
Volume46,Number2(2003),pages43^8 .
[Baldwin2002]J.Baldwin,"LockingintheMultithreadedFreeBSDKernel",
USENIXBSD(2002).
[Barnes1993]G.Barnes,"AMethodforImplementin gLock-FreeSharedData
Structures",ProceedingsoftheACMSymposiumonParallelAlgorithmsandArchi-tectures(1993),pages261-270.
[Barrera1991]J.S.Barrera,"AFastMachNetworkIPCImplementation" ,
ProceedingsoftheUSENIXMachSymposium(1991),pages1-12.
Bibliography85 7
[Basuetal.1995]A.Basu,V.Buch,W.Vogels,andT.vonEicken,"U-Net:AUser-LevelNetworkInterfaceforParallelandDistributedComputing",Proceedings
oftheACMSymposiumonOperatingSi/stemsPrinciples(1995).
[Bayeretal.1978]R.Bayer,R.M.Graham,andG.Seegmuller,editors,Operating
Systems-AnAdvancedCourse,SpringerVerlag(1978).
[Bays1977]C.Bays,"AComparisonofNext-Fit,First-Fitan dBest-Fit",Commu-nicationsoftheACM,Volume20,Number3(1977),pages191-192.
[Belady1966]L.A.Belady,"AStudyofReplacementAlgorithmsforaVirtual-StorageComputer",IBMSystemsJournal,Volume5,Number2(1966),pages
78-101.
[Beladyetal.1969]L.A.Belady,R.A.Nelson,andG.S.Shedler,"AnAnomalyin
Space-TimeCharacteristicsofCertainProgramsRunninginaPagingMachine",
CommunicationsoftheACM,Volume12,Number6(1969),pages349-353.
[Bellovin1989]S.M.Bellovin,"SecurityProblemsinth eTCP/I PProtocol
Suite",ComputerCommunicationsReview,Volume19:2,(1989),pages32^8 .
[Ben-Ari1990]M.Ben-Ari,PrinciplesofConcurrentandDistributed Programming,
PrenticeHall(1990).
[Benjamin1990]C.D.Benjamin,"TheRoleofOpticalStorageTechnologyfor
NASA"',Proceedings,StorageandRetrievalSystemsandApplications(1990),pages
10-17.
[BernsteinandGoodman1980]P.A.Bernsteinan dN.Goodman,"Time-Stamp-BasedAlgorithmsforConcurrencyControlinDistributedDatabaseSystems",
ProceedingsoftheInternationalConferenceonVeryLargeDatabases(1980),pages
285-300.
[Bernsteinetal.1987]A.Bernstein,V.Hadzilacos,andN.Goodman,Concur-rencyControlandRecoveryinDatabaseSystems,Addison-Wesley(1987).
[Bershad1993]B.Bershad,"PracticalConsiderationsforNon-BlockingConcur-ren tObjects",IEEEInternational ConferenceonDistributedComputing Si/stems
(1993),pages264-273.
[BershadandPinkerton1988]B.N.BershadandC.B.Pinkerton,"Watchdogs:
ExtendingtheUnixFileSystem'',ProceedingsoftheWinterUSENIXConference
(1988).
[Bershadetal.1990]B.N.Bershad,T.E.Anderson,E.D.Lazowska,andH.M.
Levy,"LightweightRemoteProcedureCall",ACMTransactionsonComputer
Systems,Volume8,Number1(1990),pages37-55.
[Bershadetal.1995]B.N.Bershad,S.Savage,P.Pardyak,E.G.Sirer,M.Fiuczyn-ski,D.Becker,S.Eggers,an dC.Chambers,"Extensibility,SafetyandPerfor-manceintheSPINOperatingSystem",ProceedingsoftheACMSymposiumon
OperatingSystemsPrinciples(1995),pages267-284.
[BeveridgeandWiener1997]J.BeveridgeandR.Wiener,MuththreadingAppli-cationsinWin32,Addison-Wesley(1997).
85 8Bibliography
[Birrell1989]A.D.Birrell."AnIntroductio ntoProgrammingwithThre&ds".
TechnicalReport35,DEC-SRC(1989).
[BirrellandNelson1984]A.D.BirrellandB.J.Nelson,"ImplementingRemote
ProcedureCalls",ACMTransactionsonComputerSystems,Volume2,Number1
(1984),pages39-59.
[Black1990]D.L.Black,"SchedulingSupportforConcurrencyandParallelism
inth eMachOperatingSystem",IEEEComputer,Volume23,Number5(1990), pages35^13. [BlumofeandLeiserson1994]R.BlumofeandC.Leiserson,"SchedulingMulti-threade dComputationsbyWorkStealing",ProceedingsoftheAnnualSymposium onFoundationsofComputerScience(1994),pages356-368. [Bobrowetal.1972]D.G.Bobrow,J.D.Burchfiel,D.L.Murphy,an dR.S.Tom-linson ,"TENEX,aPagedTimeSharingSystemforth ePDP-10",Communications oftheACM,Volume15,Number3(1972). [Boloskyetal.1997]W.J.Bolosky,R.P.Fitzgerald,andJ.R.Douceur,"Dis-tribute dScheduleManagementinth eTigerVideoFileserver",Proceedingsofthe
ACMSymposiumonOperatingSystemsPrinciples(1997),pages212-223.
[Bonwick1994]J.Bonwick,"TheSlabAllocator:AnObject-CachingKernel
MemoryAllocator",USENIXSummer(1994),pages87-98.
[BonwickandAdams2001]J.BonwickandJ.Adams,"Magazinesan dVmem:
Extendingth eSlabAllocatortoManyCPUsandArbitraryResources",Proceed-ingsofthe2001USENIXAnnualTechnical Conference(2001).
[BovetandCesati2002]D.P.BovetandM.Cesati,UnderstandingtheLinux
Kernel,SecondEdition,O'Reilly&Associates(2002).
[Brain1996]M.Brain,Win32SystemServices, SecondEdition,PrenticeHall(1996).
[Brent1989]R.Brent,"EfficientImplementatio noftheFirst-FitStrategyfor
DynamicStorageAllocation"',ACMTransactionsonProgrammingLanguages and
Systems,Volume11,Number3(1989),pages388-103.
[Brereton1986]O.P.Brereton,"ManagementofReplicatedFilesinaUNIX
Environment",Software—PracticeandExperience,Volume16,(1986),pages771 -780.
[Brinch-Hansen1970]P.Brinch-Hansen,"TheNucleusofaMultiprogramming
System",CommunicationsoftheACM,Volume13,Number4(1970),pages
238-241and250.
[Brinch-Hansen1972]P.Brinch-Hansen,"StructuredMultiprogramming",
CommunicationsoftheACM,Volume15,Number7(1972),pages574-578.
[Brinch-Hanse n1973]P.Brinch-Hansen,OperatingSystemPrinciples,Prentice
Hall(1973).
[Brookshear2003]J.G.Brookshear,ComputerScience:AnOverview,Seventh
Edition,Addison-Wesley(2003).
[Brownbridgeetal.1982]D.R.Brownbridge,L.F.Marshall,andB.Randell,
"TheNewcastleConnectionorUNIXesofth eWorldUnite!",Software—Practice
Bibliography85 9 andExperience,Volume12,Number12(1982),pages1147-1162. s
[Burns1978]J.E.Burns,'"MutualExclusionwithLinearWaitingUsingBinary
SharedVariables",S1GACTNezus,Volume10,Number2(1978),pages42-47.
[Butenhof1997]D.Burenhof,ProgrammingwithPOSIXThreads,Addison-Wesley(1997).
[Buyya1999]R.Buyya,HighPerformance ClusterComputing: Architecturesand
Systems,PrenticeHall(1999).
[Callaghan2000]B.Callaghan,NFSIllustrated,Addison-Wesley(2000).
[CalvertandDonahoo2001]K.CalvertandM.Donahoo,TCP/IPSocketsinJava:
PracticalGuidefor Programmers,MorganKaufmann(2001).
[Cantrilletal.2004]B.M.Cantrill,M.W.Shapiro,andA.H.Leventhal,"Tech-niquesforth eDesignofJavaOperatingSystems",2004USENIXAnnualTechnical
Conference(2004).
[CarrandHennessy1981]W.R.CarrandJ.L.Hennessy,"WSClock—ASimple andEffectiveAlgorithmforVirtualMemoryManagement",Proceedingsofthe ACMSymposiumonOperatingSystems Principles(1981),pages87-95.
[CarvalhoandRoucairol1983]O.S.CarvalhoandG.Roucairol,"OnMutual
ExclusioninComputerNetworks",CommunicationsoftheACM,Volume26,
Number2(1983),pages146-147.
[ChandyandLamport1985]K.M.ChandyandL.Lamport,"DistributedSnap-shots:DeterminingGlobalStatesofDistributedSystems",ACMTransactionson
ComputerSi/stems,Volume3,Number1(1985),pages63-75.
[Chang1980]E.Chang,"N-Philosophers:AnExerciseinDistributedControl",
ComputerNehvorks,Volume4,Number2(1980),pages71-76.
[ChangandMergen1988]A.ChangandM.EMergen,"801Storage:Archi-tectureandProgramming",ACMTransactionsonComputerSystems,Volume6,
Number1(1988),pages28-50.
[Chaseetal.1994]J.S.Chase,H.M.Levy,M.J.Feeley,an dE.D.Lazowska,
"SharingandProtectioninaSingle-Address-SpaceOperatingSystem",ACM
TransactionsonComputerSystems,Volume12,Number4(1994),pages271-307.
[Chenetal.1994]P.M.Chen,E.K.Lee,G.A.Gibson,R.H.Katz,andD.A.
Patterson,"RAID:High-Performance,ReliableSecondaryStorage",ACM Com-putingSurvey,Volume26,Number2(1994),pages145-185.
[Cheswicketal.2003]W.Cheswick,S.Bellovin,an dA.Rubin,Firewalls and
InternetSecurity:Repelling the WilyHacker,secondedition,Addison-Wesley
(2003).
[CheungandLoong1995]W.H.CheungandA.H.S.Loong,"ExploringIssues ofOperatingSystemsStructuring:FromMicrokerneltoExtensibleSystems", OperatingSystemsReview,Volume29,(1995),pages4-16.
[Chi1982]C.S.Chi,"AdvancesinComputerMassStorageTechnology",Com-puter,Volume15,Number5(1982),pages60-74.
86 0Bibliography
[Coffmanetal.1971]E.G.Coffman,M.J.Elphick,andA.Shoshani,"System
Deadlocks",Computing Surveys,Volume3,Number2(1971),pages67-78.
[CohenandJefferson1975]E.S.CohenandD.Jefferson,"Protectioninth e
HydraOperatingSystem",ProceedingsoftheACMSymposiumonOperating
SystemsPrinciples(1975),pages141-160.
[CohenandWoodring1997]A.CohenandM.Woodring,Win32Multithreaded
Programming,O'Reilly&Associates(1997).
[Comer1999]D.Comer,Internetworking withTCP/IP,VolumeII,ThirdEdition,
PrenticeHall(1999).
[Comer2000]D.Comer,Internetworking withTCP/IP,VolumeI,FourthEdition,
PrenticeHall(2000).
[CorbatoandVyssotsky1965]F.J.Corbatoan dV.A.Vyssotsky,"Introduction andOverviewoftheMULTICSSystem",ProceedingsoftheAFIPSFallJoint ComputerConference(1965),pages185-196.
[Corbatoetal.1962]F.J.Corbato,M.Merwin-Daggett,andR.C.Daley,"An
ExperimentalTime-SharingSystem",ProceedingsoftheAFIPSFallJointComputer
Conference(1962),pages335-344.
[Coulourisetal.2001]G.Coulouris,J.Dollimore,andT.Kindberg,Distributed
SystemsConceptsand Designs, ThirdEdition,AddisonWesley(2001).
[Courtoisetal.1971]P.J.Courtois,F.Heymans,andD.L.Parnas,"Concurrent
Controlwith'Readers 'and'Writers'" ,CommunicationsoftheACM,Volume14,
Number10(1971),pages667-668.
[Culleretal.1998]D.E.Culler,J.P.Singh,andA.Gupta,ParallelComputer
Architecture:AHardware/SoftwareApproach,MorganKaufmannPublishersInc.
(1998).
[Custer1994]H.Custer,Inside theWindoiusNTFileSystem,MicrosoftPress
(1994).
[Dabeketal.2001]F.Dabek,M.F.Kaashoek,D.Karger,R.Morris,andI.Stoica,
"Wide-AreaCooperativeStoragewithCFS",ProceedingsoftheACMSymposium
onOperatingSystemsPrinciples(2001),pages202-215.
[DaleyandDennis1967]R.C.DaleyandJ.B.Dennis,"VirtualMemory,Pro-cesses,an dSharinginMultics",ProceedingsoftheACMSymposiumonOperating
SystemsPrinciples(1967),pages121-128.
[DavcevandBurkhard1985]D.DavcevandW.A.Burkhard,"Consistencyand
RecoveryControlforReplicatedFiles",ProceedingsoftheACMSymposiumon
OperatingSystemsPrinciples(1985),pages87-96.
[Davies1983]D.W.Davies,"Applyingth eRSADigitalSignaturetoElectronic
Mail",Computer,Volume16,Number2(1983),pages55-62.
[deBruijn1967]N.G.deBruijn,"AdditionalCommentsonaProbleminCon-currentProgrammingandControl",CommunicationsoftheACM,Volume10,
Number3(1967),pages137-138.
Bibliography86 1
[Deitel1990]H.M.Deitel,AnIntroductiontoOperatingSystems, SecondEdition,
Addison-Wesley(1990) .
[Denning1968]P.J.Denning,''TheWorkingSetModelfo rProgramBehavior",
CommunicationsoftheACM,Volume11,Number5(1968) ,pages323-333.
[Denning1980]P.J.Denning,"'WorkingSetsPastandPresent",IEEETransactions
onSofhvareEngineering,VolumeSE-6,Number1(1980) ,pages64-84.
[Denning1982]D.E.Denning,CryptographyandDataSecurity,Addison-Wesley
(1982) .
[Denning1983]D.E.Denning,"ProtectingPublicKeysandSignatureKeys'",
Computer,Volume16,Number2(1983) ,pages27-35.
[Denning1984]D.E.Denning,"DigitalSignatureswithRS AandOtherPublic-KeyCryptosystems",CommunicationsoftheACM,Volume27,Number4(1984) , pages388-392. [DenningandDenning1979]D.E.DenningandP.J.Denning,"DataSecurity",
ACMComput.Sum,Volume11,Number3(1979) ,pages227-249.
[Dennis1965]J.B.Dennis,"SegmentationandtheDesignofMultiprogrammed
ComputerSystems",CommunicationsoftheACM,Volume8,Number4(1965) , pages589-602. [DennisandHorn1966 ]J.B.DennisandE.C.V.Horn,"ProgrammingSeman-ticsfo rMultiprogrammedComputations",CommunicationsoftheACM,Volume
9,Number3(1966) ,pages143-155.
[DiPietroandMancini2003]R.DiPietroandL.V.Mancini,"Securityand
PrivacyIssuesofHandheldandWearableWirelessDevices",Communications oftheACM,Volume46,Number9(2003) ,pages74-79.
[DiffieandHellman1976 ]W.DiffieandM.E.Hellman,"NewDirectionsin
Cryptography",IEEETransactionsonInformationTheory,Volume22,Number6
(1976) ,pages644-654.
[DiffieandHellman1979 ]W.DiffieandM.E.Hellman,"PrivacyandAuthen-tication",ProceedingsoftheIEEE(1979) ,pages397-427.
[Dijkstra1965a ]E.W.Dijkstra."CooperatingSequentialProcesses".Technical
Report,TechnologicalUniversity,Eindhoven,theNetherlands(1965) .
[Dijkstr a1965b]E.W.Dijkstra,"SolutionofaProbleminConcurrentProgram-mingControl",CommunicationsoftheACM,Volume8,Number9(1965) ,page
569.
[Dijkstra1968 ]E.W.Dijkstra,"TheStructureoftheTHEMultiprogramming
System",CommunicationsoftheACM,Volume11,Number5(1968) ,pages
341-346.
[Dijkstra1971 ]E.W.Dijkstra,"HierarchicalOrderingofSequentialProcesses",
AdaInformatica,Volume1,Number2(1971) ,pages115-138.
[DoD1985 ]TrustedComputerSystemEvaluation Criteria.DepartmentofDefense
(1985).
86 2Bibliography
[Douganetal.1999]C.Dougan,P.Mackerras,andV.Yodaiken,''Optimizin g th eIdleTaskan dOtherMMUTricks",ProceedingsoftheSymposiumonOperating
SystemDesignandImplementation(1999).
[DouglisandOusterhout1991]F.DouglisandJ.K.Ousterhout,"Transpar-entProcessMigration:DesignAlternativesandtheSpriteImplementation" , softioare,Volume21,Number8(1991),pages757-785. [Douglisetal.1994]F.Douglis,F.Kaashoek,K.Li,R.Caceres,B.Marsh,and
J.A.Tauber,"StorageAlternativesforMobileComputers",Proceedingsoftlw
SymposiumonOperatingSystemsDesignandImplementation(1994),pages25-37.
[Douglisetal.1995]F.Douglis,P.Krishnan,andB.Bershad,''Adaptiv eDisk
Spin-DownPoliciesforMobileComputers",ProceedingsoftheUSENIXSympo-siumonMobileandLocationIndependentComputing(1995),pages121-137.
[Dravesetal.1991]R.P.Draves,B.N.Bershad,R.F.Rashid,andR.W.Dean,
"Usingcontinuationst oimplemen tthrea dmanagementan dcommunication inoperatingsystems",ProceedingsoftheACMSymposiumonOperatingSystems Principles(1991),pages122-136.
[DruschelandPeterson1993]P.DruschelandL.L.Peterson,"Fbufs:AHigh-BandwidthCross-DomainTransferFacility",ProceedingsoftheACMSymposium
onOperatingSystemsPrinciples(1993),pages189-202.
[Eastlake1999]D.Eastlake,"DomainNameSystemSecurityExtensions",Net-workWorkingGroup,RequestforComments:2535(1999).
[EisenbergandMcGuire1972]M.A.EisenbergandM.R.McGuire,"Further
CommentsonDijkstra'sConcurrentProgrammingControlProblem",Commu-nicationsoftheACM,Volume15,Number11(1972),page999.
[EkanadhamandBernstein1979]K.EkanadhamandA.J.Bernstein,"Condi-tionalCapabilities",IEEETransactionsonSoftwareEngineering,VolumeSE-5,
Number5(1979),pages458-464.
[Engelschall2000]R.Engelschall,"PortableMultithreading:TheSignalStack
TrickForUser-SpaceThreadCreation",Proceedingsofthe2000USENIXAnnual
TechnicalConference(2000).
[Eswaranetal.1976]K.P.Eswaran,J.N.Gray,R.A.Lorie,an dI.L.Traiger,
"TheNotionsofConsistencyandPredicateLocksinaDatabaseSystem",
CommunicationsoftheACM,Volume19,Number11(1976),pages624-633.
[Fangetal.2001]Z.Fang,L.Zhang,J.B.Carter,W.C.Hsieh,andS.A.McKee,
"ReevaluatingOnlineSuperpagePromotionwithHardwareSupport",Proceed-ingsoftheInternationalSymposium onHigh-Performance ComputerArchitecture,
Volume50,Number5(2001).
[Farrow1986a]R.Farrow,"SecurityforSuperusers,orHowtoBreaktheUNIX
System",UNIXWorld(May1986),pages65-70.
[Farrow1986b]R.Farrow,"SecurityIssuesandStrategiesforUsers",UNIX
World(April1986),pages65-71.
[FeitelsonandRudolph1990]D.FeitelsonandL.Rudolph,"Mappin gand
SchedulinginaSharedParallelEnvironmentUsingDistributedHierarchical
Bibliography86 3
Control",ProceedingsoftheInternationalConferenceonParallelProcessing(19,90) .
[Fidge1991]C.Fidge,"LogicalTimeinDistributedComputingSystems",
Computer,Volume24,Number8(1991),pages28-33.
[FilipskiandHanko1986]A.FilipskiandJ.Hanko,"MakingUNIXSecure",
Byte(April1986),pages113-128.
[Fisher1981]J.A.Fisher,"TraceScheduling:ATechniqueforGlobalMicrocode
Compaction",IEEETransactionsonComputers,Volume30,Number7(1981), pages478-490. [FolkandZoellick1987]M.J.FolkandB.Zoellick,FileStructures,Addison-Wesley(1987).
[Forrestetal.1996]S.Forrest,S.A.Hofmeyr,andT.A.Longstaff,"ASense
ofSelfforUNIXProcesses",ProceedingsoftheIEEESymposiumonSecurityand
Privacy(1996),pages120-128.
[Fortier1989]P.J.Fortier,HandbookofLANTechnology,McGraw-Hill(1989).
[FreeBSD1999]FreeBSD,FreeBSD Handbook,TheFreeBSDDocumentation
Project(1999).
[Freedman1983]D.H.Freedman,"SearchingforDenserDisks",Infosystems
(1983),page56.
[Fuhrt1994]B.Fuhrt,"MultimediaSystems:AnOverview",7EE EMultiMedia,
Volume1,Number1(1994),pages47-59.
[Fujitani1984]L.Fujitani,"LaserOpticalDisk:TheComingRevolutioninOn-LineStorage",CommunicationsoftheACM,Volume27,Number6(1984),pages
546-554.
[Gait1988]J.Gait,"TheOpticalFileCabinet:ARandom-AccessFileSystemfor
Write-OnOpticalDisks",Computer,Volume21,Number6(1988).
[GanapathyandSchimmel1998]N.GanapathyandC.Schimmel,"General
PurposeOperatingSystemSupportforMultiplePageSizes",Proceedingsofthe
USENIXTechnical*Conference(1998).
[Gangeretal.2002]G.R.Ganger,D.R.Engler,M.F.Kaashoek,H.M.Briceno,
R.Hunt,andT.Pinckney,"FastandFlexibleApplication-LevelNetworkingon
ExokernelSystems'",ACMTransactionsonComputer Systems,Volume20,Number
1(2002),pages49-83.
[Garcia-Molina1982]H.Garcia-Molina,"ElectionsinDistributedComputing
Systems",IEEETransactionsonComputers,VolumeC-31,Number1(1982).
[Garfinkeletal.2003]S.Garfinkel,G.Spafford,andA.Schwartz,PracticalUNIX
&InternetSecurity,O'Reilly&Associates(2003).
[Gibsonetal.1997a]G.Gibson,D.Nagle,K.Amiri,F.Chang,H.Gobioff,
E.Riedel,D.Rochberg,andJ.Zelenka."FilesystemsforNetwork-Attached
SecureDisks".TechnicalReport,CMU-CS-97-112(1997).
[Gibsonetal.1997b]G.A.Gibson,D.Nagle,K.Amiri,F.W.Chang,E.M.
Feinberg,H.Gobioff,C.Lee,B.Ozceri,E.Riedel,D.Rochberg,andJ.Zelenka,
86 4Bibliography
"FileServerScalingwithNetwork-AttachedSecureDisks",Measurementand
ModelingofComputerSystems(1997),pages272-284.
[Gifford1982]D.K.Gifford,"CryptographicSealingforInformationSecrecy
an dAuthentication",CommunicationsoftheACM,Volume25,Number4(1982), pages274-286. [Goldbergetal.1996]I.Goldberg,D.Wagner,R.Thomas,an dE.A.Brewer,'A
SecureEnvironmentforUntrustedHelperApplications",Proceedingsofthe6th
UsenixSecuritySymposium(1996).
[GoldenandPechura1986]D.GoldenandM.Pechura,"TheStructureofMicro-computerFileSystems",CommunicationsoftheACM,Volume29,Number3
(1986),pages222-230.
[Goldingetal.1995]R.A.Golding,RB.II,C.Staelin,T.Sullivan,an dJ.Wilkes,
"IdlenessisNotSloth",USENIXWinter(1995),pages201-212.
[Golmetal.2002]M.Golm,M.Felser,C.Wawersich,andJ.Kleinoder,"TheJX
OperatingSystem",2002USENIXAnnualTechnicalConference(2002).
[Gong2002]L.Gong,"Peer-to-PeerNetworksinAction",IEEEInternet Comput-ing,Volume6,Number1(2002).
[Gongetal.1997]L.Gong,M.Mueller,H.Prafullchandra,andR.Schemers,
"GoingBeyondtheSandbox:AnOverviewoftheNewSecurityArchitecturein th eJavaDevelopmentKit1.2",ProceedingsoftheUSENIXSymposiumonInternet
TechnologiesandSystems(1997).
[Goodmanetal.1989]J.R.Goodman,M.K.Vernon,an dP.J.Woest,"Efficient
SynchronizationPrimitivesforLarge-ScaleCache-CoherentMultiprocessors",
ProceedingsoftheInternationalConferenceonArchitectural SupportforProgramming
LanguagesandOperatingSystems(1989),pages64-75.
[Goslingetal.1996]J.Gosling,B.Joy,andG.Steele,TheJavaLanguageSpecifica-tion,Addison-Wesley(1996).
[GovindanandAnderson1991]R.GovindanandD.P.Anderson,"Scheduling
andIPCMechanismsforContinuousMedia",ProceedingsoftheACMSymposium onOperatingSystemsPrinciples(1991),pages68-80. [GramppandMorris1984]F.T.GramppandR.H.Morris,"UNIXOperating-SystemSecurity",AT&TBellLaboratoriesTechnicalJournal,Volume63,(1984), pages1649-1672. [Gray1978]J.N.Gray,"NotesonDataBaseOperatingSystems",in[Bayeret al.1978](1978),pages393-481. [Gray1981]J.N.Gray,"TheTransactionConcept:VirtuesandLimitations",
ProceedingsoftheInternationalConferenceonVeryLargeDatabases(1981),pages
144-154.
[Gray1997]J.Gray,InterprocessCommunicationsinUNIX,PrenticeHall(1997).
[Grayetal.1981]J.N.Gray,P.R.Mcjones,andM.Blasgen,"TheRecovery
ManageroftheSystemRDatabaseManager",ACMComputing Survey,Volume
13,Number2(1981),pages223-242.
Bibliography86 5
[Greenawalt1994]P.Greenawalt,"ModelingPowerManagementfor *Hard
Disks",ProceedingsoftheSymposiumonModelingandSimulationofComputer
TelecommunicationSystems(1994),pages62-66.
[Grosshans1986]D.Grosshans,File SystemsDesignandImplementation,Prentice
Hall(1986).
[Grosso2002]W.Grosso,JavaRMI,O'Reilly&Associates(2002).
[Habermann1969]A.N.Habermann,"PreventionofSystemDeadlocks",Com-municationsoftheACM,Volume12,Number7(1969),pages373-377,385.
[Halletal.1996]L.Hall,D.Shmoys,an dJ.Wein,"SchedulingToMinimize
AverageCompletionTime:Off-lineandOn-lineAlgorithms",SODA:ACM-SIAMSymposiumonDiscreteAlgorithms(1996).
[Halsall1992]F.Halsall,Data Communications,ComputerNetxuorksandOpen
Systems,Addison-Wesley(1992).
[Hamacheretal.2002]C.Hamacher,Z.Vranesic,andS.Zaky,ComputerOrga-nization,FifthEdition,McGraw-Hill(2002).
[HanandGhosh1998]K.HanandS.Ghosh,"AComparativeAnalysisof
VirtualVersusPhysicalProcess-MigrationStrategiesforDistributedModeling andSimulationofMobileComputingNetworks",WirelessNetworks,Volume4, Number5(1998),pages365-378.
[HansenandAtkins1993]S.E.HansenandE.T.Atkins,"Automate dSystem
MonitoringandNotificationWithSwatch",ProceedingsoftheUSENIXSystems
AdministrationConference(1993).
[Harchol-BalterandDowney1997]M.Harchol-Balteran dA.B.Downey,
"ExploitingProcessLifetimeDistributionsforDynamicLoadBalancing",ACM
TransactionsonComputerSystems,Volume15,Number3(1997),pages253-285.
[HarishandOwens1999]V.C.HarishandB.Owens,"DynamicLoadBalancing
DNS",LimaJournal,Volume1999,Number64(1999).
[Harkeretal.1981]J.M.Harker,D.W.Brede,R.E.Pattison,G.R.Santana,and
L.G.Taft,"AQuarterCenturyofDiskFileInnovation" ,IBMJournalofResearch andDevelopment,Volume25,Number5(1981),pages677-689. [Harrisonetal.1976]M.A.Harrison,W.L.Ruzzo,andJ.D.Ullman,"Protection inOperatingSystems",CommunicationsoftheACM,Volume19,Number8(1976), pages461-471.
[HartmanandOusterhout1995]J.H.Hartma nan dJ.K.Ousterhout,"TheZebra
StripedNetworkFileSystem",ACM TransactionsonComputerSystems,Volume
13,Number3(1995),pages274-310.
[Havender1968]J.W.Havender,"AvoidingDeadlockinMultitaskingSystems",
IBMSystemsJournal,Volume7,Number2(1968),pages74-84.
[Hechtetal.1988]M.S.Hecht,A.Johri,R.Aditham,an dT.J.Wei,"Experience
AddingC2SecurityFeaturestoUNIX",ProceedingsoftheSummerUSENIX
Conference(1988),pages133-146.
86 6Bibliography
[HennessyandPatterson2002]J.L.HennessyandD.A.Patterson,Corhputer
Architecture:AQuantitativeApproach,ThirdEdition,MorganKaufmannPublish-ers(2002) .
[Henr y1984]G.Henry,"TheFairShareScheduler",AT&TBel!Laboratories
TechnicalJournal(1984).
[Herlihy1993]M.Herlihy,"AMethodologyfo rImplementingHighlyConcur-rentDataObjects",ACM TransactionsonProgrammingLanguagesand Systems,
Volume15,Number5(1993) ,pages745-770.
[HerlihyandMoss1993]M.HerlihyandJ.E.B.Moss,"TransactionalMemory:
ArchitecturalSupportForLock-FreeDataStructures",Proceedingsofthe Twentieth
AnnualInternationalSymposiumonComputer Architecture(1993) .
[Hitze tal.1995]D.Hitz,J.Lau,andM.Malcolm,"FileSystem
Designfo ranNFSFileServerAppliance",TechnicalReportTR3002
(http://www.netapp.com/techJibrary/3002.html),NetApp(1995) .
[Hoagland1985]A.S.Hoagland,"InformationStorageTechnology—ALookat
theFuture",Computer,Volume18,Number7(1985) ,pages60-68.
[Hoar e1972]C.A.R.Hoare,"TowardsaTheoryofParallelProgramming",in
[Hoar eandPerrott1972 ](1972) ,pages61-71.
[Hoar e1974]C.A.R.Hoare,"Monitors:AnOperatingSystemStructuring
Concept",CommunicationsoftheACM,Volume17 ,Number10(1974) ,pages
549-557.
[Hoar eandPerrott1972]C.A.R.HoareandR.H.Perrotteditors,Operating
SystemsTechniques,AcademicPress(1972) .
[Holt1971 ]R.C.Holt,"CommentsonPreventionofSystemDeadlocks",Com-municationsoftheACM,Volume14,Number1(1971) ,pages36-38.
[Holt1972]R.C.Holt,"SomeDeadlockPropertiesofComputerSystems",
ComputingSurveys,Volume4,Number3(1972) ,pages179-196.
[Holub2000]A.Holub,TamingJavaThreads,Apress(2000) .
[Hongetal.1989]J.Hong,X.Tan,andD.Towsley,"APerformanceAnalysis
ofMinimumLaxityandEarliestDeadlineSchedulinginaReal-TimeSystem",
IEEETransactionsonComputers,Volume38,Number12(1989) ,pages1736-1744.
[Howar detal.1988]J.H.Howard,M.L.Kazar,S.G.Menees,D.A.Nichols,
M.Satyanarayanan,andR.N.Sidebotham,"ScaleandPerformanceina
DistributedFileSystem",ACMTransactionsonComputerSystems,Volume6,
Number1(1988) ,pages55-81.
[Howart hetal.1961]D.J.Howarth,R.B.Payne,andF.H.Sumner,'Th e
ManchesterUniversityAtlasOperatingSystem,PartII:User'sDescription",
ComputerJournal,Volume4,Number3(1961) ,pages226-229.
[Hsiaoetal.1979]D.K .Hsiao,D.S.Kerr,andS.E.Madnick,ComputerSecurity,
AcademicPress(1979) .
[H uandPerrig2004]Y.-C.HuandA.Perrig,"SPV :ASecurePathVector
RoutingSchemefo rSecuringBGP",ProceedingsofACMSIGCOMM Conference
Bibliography86 7 onDataCommunication(2004).? [Huetal.2002]Y.-C.Hu,A.Perrig,andD.Johnson,"Ariadne:ASecureOn-DemandRoutingProtocolforAdHocNetworks",ProceedingsoftheAnnual
InternationalConferenceonMobileComputingandNetworking(2002).
[Hyman1985]D.Hyman,The ColumbusChicken Statuteand MoreBonehead
Legislation,S.GreenePress(1985).
[Iacobucci1988]E.Iacobucci,OS/2Programmer's Guide,OsborneMcGraw-Hill
(1988).
[IBM1983]TechnicalReference.IBMCorporation(1983).
[IliffeandJodeit1962]J.K.IliffeandJ.G.Jodeit,"ADynamicStorageAlloca-tionSystem",ComputerJournal,Volume5,Number3(1962),pages200-209.
[Intel1985a]iAPX286Programmer'sReferenceManual.IntelCorporation(1985).
[Intel1985b]iAPX86/88,186/188User'sManualProgrammer'sReference.Intel
Corporation(1985).
[Intel1986]iAPX386Programmer'sReferenceManual.IntelCorporation(1986).
[Intel1990]i486Microprocessor Programmer'sReferenceManual.IntelCorporation
(1990).
[Intel1993]PentiumProcessor User'sManual,Volume3:ArchitectureandProgram-mingManual.IntelCorporation(1993).
[Iseminger2000]D.Iseminger,ActiveDirectoryServicesforMicrosoftWindows
2000.TechnicalReference,MicrosoftPress(2000).
[JacobandMudge1997]B.Jacoban dT.Mudge,"Software-ManagedAddress
Translation",ProceedingsoftheInternationalSymposiumonHighPerformance
ComputerArchitectureandImplementation(1997).
[JacobandMudge1998a]B.JacobandT.Mudge,"VirtualMemoryinCon-temporar yMicroprocessors",IEEEMicroMagazine,Volume18,(1998),pages
60-75.
[JacobandMudge1998b]B.Jacoban dT.Mudge,"VirtualMemory:Issuesof
Implementation" ,IEEEComputerMagazine,Volume31,(1998),pages33-43.
[JacobandMudge2001]B.JacobandT.Mudge,"UniprocessorVirtualMemory
WithoutTLBs",IEEETransactionsonComputers,Volume50,Number5(2001).
[JacobsonandWilkes1991]D.M.JacobsonandJ.Wilkes."DiskScheduling
AlgorithmsBasedonRotationalPosition".TechnicalReportHPL-CSP-91-7
(1991).
[Jensenetal.1985]E.D.Jensen,C.D.Locke,andH.Tokuda,"ATime-Driven
SchedulingModelforReal-TimeOperatingSystems",ProceedingsoftheIEEE
Real-TimeSystemsSymposium(1985),pages112-122.
[JohnstoneandWilson1998]M.S.Johnstonean dP.R.Wilson,"TheMemory
FragmentationProblem:Solved?",ProceedingsoftheFirst InternationalSymposium onMemorymanagement(1998),pages26-36. 86 8Bibliography
[Jone sandLiskov1978]A.K.JonesandB.H.Liskov,"ALanguageExtension fo rExpressingConstraintsonDataAccess",CommunicationsoftheACM,Volume
21,Number5(1978) ,pages358-367.
[Ju letal.1988]E.Jul,H.Levy,N.Hutchinson,andA.Black,"Fine-Grained
MobilityintheEmeraldSystem",ACMTransactionsonComputerSystems,Volume
6,Number1(1988) ,pages109-133.
[Kaashoeketal.1997]M.F.Kaashoek,D.R.Engler,G.R.Ganger,H.M.Briceno,
R.Hunt,D.Mazieres,T.Pinckney,R.Grimm,J.Jannotti,andK.Mackenzie,
"Applicationperformanceandflexibilityonexokernelsystems",Proceedingsof
theACMSymposiumonOperatingSystems Principles(1997) ,pages52-65.
[Kat zetal.1989]R.H.Katz,G.A.Gibson,andD.A.Patterson,"DiskSystem
Architecturesfo rHighPerformanceComputing",ProceedingsoftheIEEE(1989) .
[Ka yandLauder1988]J.KayandP.Lauder,"AFairShareScheduler",Commu-nicationsoftheACM,Volume31,Number1(1988) ,pages44-55.
[Ken tetal.2000]S.Kent,C.Lynn,andK.Seo,"SecureBorderGatewayProtocol
(Secure-BGP)",IEEEJournalonSelectedAreasinCommunications,Volume18,
Number4(2000) ,pages582-592.
[Kenville1982]R.F.Kenville,"OpticalDiskDataStorage",Computer,Volume
15,Number7(1982) ,pages21-26.
[Kessels1977]J.L.W.Kessels,"AnAlternativetoEventQueuesfo rSynchro-nizationinMonitors",CommunicationsoftheACM,Volume20,Number7(1977) , pages500-503. [Khann aetal.1992 ]S.Khanna,M.Sebree,andJ.Zolnowsky,"Realtime
SchedulinginSunOS5.0",ProceedingsoftheWinterUSENIXConference(1992) , pages375-390. [Kieburt zandSilberschatz1978]R.B.KieburtzandA.Silberschatz,"Capabil-ityManagers",IEEE TransactionsonSoftware Engineering,VolumeSE-4,Number
6(1978) ,pages467-477.
[Kieburt zandSilberschatz1983 ]R.B.KieburtzandA.Silberschatz,"Access
RightExpressions",ACMTransactionsonProgrammingLanguagesandSystems,
Volume5,Number1(1983) ,pages78-96.
[Kilburnetal.1961]T.Kilburn,D.J.Howarth,R.B.Payne,andF.H.Sumner,
"TheManchesterUniversityAtlasOperatingSystem,PartI:InternalOrganiza-tion",ComputerJournal,Volume4,Number3(1961) ,pages222-225.
[Ki mandSpafford1993]G.H.KimandE.H.Spafford,"TheDesignand
ImplementationofTripwire:AFileSystemIntegrityChecker",TechnicalReport,
PurdueUniversity(1993) .
[King1990 ]R.P.King,"DiskArmMovementi nAnticipationofFuture
Requests",ACMTransactionsonComputerSystems,Volume8,Number3(1990) , pages214-229. [KistlerandSatyanarayanan1992]J.KistlerandM.Satyanarayanan,"Discon-nectedOperationintheCodaFileSystem",ACMTransactionsonComputer
Systems,Volume10 ,Number1(1992) ,pages3-25.
Bibliography86 9
[Kleinrock1975]L.Kleinrock,QueueingSi/stems,VolumeII:ComputerApplica-tions,Wiley-Interscience(1975).
[Knapp1987]E.Knapp,"DeadlockDetectioninDistributedDatabases",Com-putingSurveys,Volume19,Number4(1987),pages303-328.
[Knowlton1965]K.C.Knowlton,"AFastStorageAllocator",Communications
oftheACM,Volume8,Number10(1965),pages623-624.
[Knuth1966]D.E.Knuth,"AdditionalCommentsonaProbleminConcurrent
ProgrammingControl",CommunicationsoftheACM,Volume9,Number5(1966), pages321-322. [Knuth1973]D.E.Knuth,TheArtofComputerProgramming,Volume1:Funda-mentalAlgorithms,SecondEdition,Addison-Wesley(1973).
[Koch1987]P.D.L.Koch,"DiskFileAllocationBasedonth eBuddySystem",
ACMTransactionsonComputerSystems,Volume5,Number4(1987),pages
352-370.
[KopetzandReisinger1993]H.KopetzandJ.Reisinger,"TheNon-Blocking
WriteProtocolNBW:ASolutiontoaReal-TimeSynchronisationProblem",IEEE
Real-TimeSystemsSymposium(1993),pages131-137.
[Kosaraju1973]S.Kosaraju,"LimitationsofDijkstra'sSemaphorePrimitives andPetriNets",OperatingSystemsRevieiv,Volume7,Number4(1973),pages 122-126.
[Kramer1988]S.M.Kramer,"RetainingSUIDProgramsinaSecureUNIX",
ProceedingsoftheSummerUSENIXConference(1988),pages107-118.
[Kubiatowiczetal.2000]J.Kubiatowicz,D.Bindel,Y.Chen,S.Czerwinski,
P.Eaton,D.Geels,R.Gummadi,S.Rhea,H.Weatherspoon,W.Weimer,C.Wells, andB.Zhao,"OceanStore:AnArchitectureforGlobal-ScalePersistentStorage", Proc.ofArchitecturalSupportforProgrammingLanguagesandOperating Systems
(2000)!
[KuroseandRoss2005]J.Kurosean dK.Ross,ComputerNetworking—ATop-DoivnApproachFeaturingtheInternet,ThirdEdition,Addison-Wesley(2005).
[Lamport1974]L.Lamport,"ANewSolutionofDijkstra'sConcurrentProgram-mingProblem",CommunicationsoftheACM,Volume17,Number8(1974),pages
453-455.
[Lamport1976]L.Lamport,"SynchronizationofIndependen tProcesses",Ada lnformatica,Volume7,Number1(1976),pages15-34. [Lamport1977]L.Lamport,"ConcurrentReadingandWriting",Communications oftheACM,Volume20,Number11(1977),pages806-811. [Lamport1978a]L.Lamport,"TheImplementatio nofReliableDistributedMul-tiprocessSystems",ComputerNetworks,Volume2,Number2(1978),pages
95-114.
[Lamport1978b]L.Lamport,"Time,Clocksandth eOrderingofEventsina
DistributedSystem",CommunicationsoftheACM,Volume21,Number7(1978),
pages558-565.
87 0Bibliography
[Lamport1981]L.Lamport,"Passwor dAuthenticationwithInsecureCommu-nications",CommunicationsoftheACM,Volume24,Number11(1981),pages
770-772.
[Lamport1986]L.Lamport,''Th eMutualExclusionProblem",Communications oftheACM,Volume33,Number2(1986),pages313-348. [Lamport1987]L.Lamport,"AFastMutualExclusionAlgorithm",ACMTrans-actionsonComputerSystems,Volume5,Number1(1987),pages1—11 .
[Lamport1991]L.Lamport,"TheMutualExclusionProblemHasBeenSolved",
CommunicationsoftheACM,Volume34,Number1(1991),page110.
[Lamportetal.1982]L.Lamport,R.Shostak,andM.Pease,"TheByzantine
GeneralsProblem'",ACMTransactionsonProgrammingLanguages and Systems,
Volume4,Number3(1982),pages382-401.
[Lampson1969]B.W.Lampson,"DynamicProtectionStructures",Proceedings oftheAF1PSFallJointComputerConference(1969),pages27-38. [Lampson1971]B.W.Lampson,"Protection",ProceedingsoftheFifthAnnual
PrincetonConferenceonInformationSystemsScience(1971),pages437-443.
[Lampson1973]B.W.Lampson,"ANoteontheConfinementProblem",Com-municationsoftheACM,Volume10,Number16(1973),pages613-615.
[LampsonandRedell1979]B.W.LampsonandD.D.Redell,"Experiencewith
ProcessesandMonitorsinMesa",Proceedingsofthe7thACMSymposiumon
OperatingSystemsPrinciples(SOSP)(1979),pages43^14.
[LampsonandSturgis1976]B.LampsonandH.Sturgis,"CrashRecoveryina
DistributedDataStorageSystem",TechnicalReport, XeroxResearchCenter(1976).
[Landwehr1981]C.E.Landwehr,"FormalModelsofComputerSecurity",
ComputingSurveys,Volume13,Number3(1981),pages247-278.
[Lann1977]G.L.Lann,"DistributedSystems—TowardaFormalApproach",
ProceedingsoftheIFIPCongress(1977),pages155-160.
[LarsonandKajla1984]P.Larsonan dA.Kajla,"FileOrganization:Implemen -tationofaMethodGuaranteeingRetrievalinOneAccess",Communicationsof theACM,Volume27,Number7(1984),pages670-677. [Lauzacetal.2003]S.Lauzac,R.Melhem,andD.Mosse,"AnImprove dRate-MonotonicAdmissionControlandItsApplications",IEEETransactionson
Computers,Volume52,Number3(2003).
[Lee2003]J.Lee,"AnEnd-UserPerspectiveonFile-SharingSystems",Commu-nicationsoftheACM,Volume46,Number2(2003),pages49-53.
[LeeandThekkath1996]E.K.LeeandC.A.Thekkath,"Petal:Distributed
VirtualDisks",ProceedingsoftheSeventhInternationalConferenceonArchitectural
SupportforProgrammingLanguagesandOperating Systems(1996),pages84-92.
[Leffleretal.1989]S.J.Leffler,M.K.McKusick,M.J.Karels,andJ.S.Quar-terman ,The Design and Implementationofthe43BSDUNIXOperatingSystem,
Addison-Wesley
C
(1989).
Bibliography871
[Lehmann1987]F.Lehmann,"Compute rBreak-Ins"',Communications"ofthe
ACM,Volume30,Number7(1987),pages584-585.
[Lehoczkyetal.1989]J.Lehoczky,L.Sha,andY.Ding,"TheRateMonotonic
SchedulingAlgorithm:ExactCharacterizationandAverageCaseBehaviour",
Proceedingsof10thIEEEReal-TimeSi/stemsSymposium(1989).
[Lempel1979]A.Lempel,"CryptologyinTransition",Computing Surveys,Vol-um e11,Number4(1979),pages286-303.
[Leslieetal.1996]I.MLeslie,D.McAuley,R.Black,T.Roscoe,P.T.Barham,
D.Evers,R.Fairbairns,andE.Hyden,"TheDesignandImplementatio nof anOperatingSystemt oSupportDistributedMultimediaApplications",IEEE journalofSelectedAreasinCommunications,Volume14,Number7(1996),pages 1280-1297.
[LettandKonigsford1968]A.L.LettandW.L.Konigsford,"TSS/360:ATime-SharedOperatingSystem",ProceedingsoftheAFIPSFallJointComputerConference
(1968),pages15-28^
[LeuteneggerandVernon1990]S.Leuteneggeran dM.Vernon,"ThePerfor-manceofMultiprogrammedMultiprocessorSchedulingPolicies",Proceedingsof theConferenceonMeasurementandModelingofComputerSystems(1990). [Levinetal.1975]R.Levin,E.S.Cohen,W.M.Corwin,F.J.Pollack,and
W.A.Wulf,"Policy/MechanismSeparationinHydra",ProceedingsoftheACM
SymposiumonOperatingSystems Principles(1975),pages132-140.
[Levine2003]G.Levine,"DefiningDeadlock",Operating Systems Review,Vol-um e37,Number1(2003).
[LewisandBerg1998]B.LewisandD.Berg,MultithreadedProgramming with
Pthreads,SunMicrosystemsPress(1998).
[LewisandBerg2000]B.LewisandD.Berg,MultithreadedProgrammingwith
JavaTechnology,SunMicrosystemsPress(2000).
[LichtenbergerandPirtle1965]W.VV .LichtenbergerandM.W.Pirtle,"AFacil-ityforExperimentationinMan-MachineInteraction",ProceedingsoftheAFIPS
FallJointComputerConference(1965),pages589-598.
[LindholmandYellin1999]T.Lindholman dF.Yellin,TheJavaVirtualMachine
Specification,SecondEdition,Addison-Wesley(1999).
[Lingetal.2000]Y.Ling,T.Mullen,an dX.Lin,"AnalysisofOptimalThread
PoolSize",OperatingSystemReview,Volume34,Number2(2000).
[Lipner1975]S.Lipner,"ACommentontheConfinementProblem",Operating
SystemReview,Volume9,Number5(1975),pages192-196.
[Lipton1974]R.Lipton."OnSynchronizationPrimitiveSystems".Ph.D.Thesis,
Carnegie-MellonUniversity(1974).
[Liskov1972]B.H.Liskov,'Th eDesignoftheVenusOperatingSystem",
CommunicationsoftheACM,Volume15,Number3(1972),pages144-149.
[LiuandLayland1973]C.L.LiuandJ.W.Layland,"SchedulingAlgorithmsfor
MultiprogramminginaHardReal-TimeEnvironment",Communicationsofthe
87 2Bibliography
ACM,Volume20,Number1(1973),pages46-61.•
[Lobel1986]J.Lobel,FoilingtheSystemBreakers:ComputerSecurityand.Acces s
Control,McGraw-Hill(1986).
[Loo2003]A.W.Loo,'"TheFutureofPeer-to-PeerComputing",Communications oftheACM,Volume46,Number9(2003),pages56-61. [Love2004]R.Love,LinuxKernelDevelopment,Developer'sLibrary(2004).
[Lowneyetal.1993]P.G.Lowney,S.M.Freudenberger,T.J.Karzes,W.D.
Lichtenstein,R.P.Nix,J.S.O'Donnell,andJ.C.Ruttenberg,"TheMultiflow
TraceSchedulingCompiler",JournalofSupercomputing,Volume7,Number1- 2
(1993),pages51-142.
[Lucco1992]S.Lucco,"ADynamicSchedulingMethodforIrregularParallel
Programs",ProceedingsoftheConferenceonProgrammingLanguageDesignand
Implementation(1992),pages200-211.
[Ludwig1998]M.Ludwig,TheGiant BlackBookofComputerViruses,Second
Edition,AmericanEaglePublications(1998).
[Ludwig2002]M.Ludwig,TheLittle BlackBookofEmailViruses,AmericanEagle
Publications(2002).
[Lumbetal.2000]C.Lumb,J.Schindler,G.R.Ganger,D.F.Nagle,an dE.Riedel,
"TowardsHigherDiskHeadUtilization:ExtractingFreeBandwidthFromBusy
DiskDrives",SymposiumonOperatingSystemsDesignandImplementation(2000).
[Maekawa1985]M.Maekawa,"ASquareRootAlgorithmforMutualExclusion
inDecentralizedSystems",ACMTransactionsonComputerSystems,Volume3,
Number2(1985),pages145-159.
[Maheretal.1994]C.Maher,J.S.Goldick,C.Kerby,andB.Zumach,"The
IntegrationofDistributedFileSystemsandMassStorageSystems",Proceedings
oftheIEEESymposiumonMass StorageSystems(1994),pages27-31.
[Marshetal.1991]B.D.Marsh,M.L.Scott,T.J.LeBlanc,andE.P.Markatos,
"First-ClassUser-LevelThreads",Proceedingsofthe13th ACMSymposiumon
OperatingSystems Principle(1991),pages110-121.
[MassalinandPu1989]H.MassalinandC.Pu,"Threadsan dInput/Outpu ti n th eSynthesisKernel",ProceedmgsoftheACMSymposiumonOperatingSystems
Principles(1989),pages191-200.
[Mattern1988]F.Mattern,"VirtualTimeandGlobalStatesofDistributed
Systems",WorkshoponParallelandDistributedAlgorithms(1988).
[Mattsonetal.1970]R.L.Mattson,J.Gecsei,D.R.Slutz,an dI.L.Traiger,
"EvaluationTechniquesforStorageHierarchies",IBM Systems Journal,Volume
9,Number2(1970),pages78-117.
[MauroandMcDougall2001]J.MauroandR.McDougall,Solaris Internals:Core
KernelArchitecture,PrenticeHall(2001).
[McCanneandJacobson1993]S.McCanneandV.Jacobson,"TheBS DPacket
Filter:ANewArchitectureforUser-levelPacketCapture",USENIXWinter
(1993),pages259-270.
Bibliography873
[McGrawandAndrews1979]J.R.McGrawan dG.R.Andrews,"Acces^Con-trolinParallelPrograms",IEEETransactionsonSoftwareEngineering,Volume
SE-5,Number1(1979),pages1-9.
[McKeagandWilson1976]R.M.McKeagan dR.Wilson,StudiesinOperating
Systems,AcademicPress(1976).
[McKeon1985]B.McKeon,
Li
AnAlgorithmforDiskCachingwithLimited
Memory",Byte,Volume10,Number9(1985),pages129-138.
[McKusicketal.1984]M.K.McKusick,W.N.Joy,S.J.Leffler,an dR.S.Fabry,
"AFastFileSystemforUNIX",ACMTransactionsonComputerSi/stems,Volume
2,Number3(1984),pages181-197.
[McKusicketal.1996]M.K.McKusick,K.Bostic,an dM.J.Karels,TheDesign andImplementationofthe4.4 BSDUNIXOperatingSi/stem,JohnWileyan dSons
(1996).
[McVoyandKleiman1991]L.W.McVoyan dS.R.Kleiman,"Extent-likePerfor-mancefromaUNIXFileSystem",ProceedingsoftheWinter USENIXConference
(1991),pages33-44.
[Mealyetal.1966]G.H.Mealy,B.I.Witt,andW.A.Clark,"TheFunctional
StructureofOS/360",IBM SystemsJournal,Volume5,Number1(1966).
[Mellor-CrummeyandScott1991]J.M.Mellor-CrummeyandM.L.Scott,
"AlgorithmsforScalableSynchronizationonShared-MemoryMultiprocessors",
ACMTransactionsonComputerSystems,Volume9,Number1(1991),pages21-65.
[MenasceandMuntz1979]D.MenasceandR.R.Muntz,"LockingandDead-lockDetectioninDistributedDataBases",IEEETransactionsonSoftzvareEngi-neering,VolumeSE-5,Number3(1979),pages195-202.
[Merceretal.1994]C.W.Mercer,S.Savage,andH.Tokuda,"ProcessorCapacity
Reserves:OperatingSystemSupportforMultimediaApplications",International
ConferenceonMultimediaComputingandSystems(1994),pages90-99.
[MeyerandSeawright1970]R.A.MeyerandL.H.Seawright,"AVirtual
MachineTime-SharingSystem",IBM SystemsJournal,Volume9,Number3
(1970),pages199-218.
[Microsoft1986]MicrosoftMS-DOSUser'sReferenceandMicrosoftMS-DOSPro-grammer'sReference.MicrosoftPress(1986).
[Microsoft1996]MicrosoftWindowsNTWorkstationResourceKit.MicrosoftPress
(1996).
[Microsoft2000a]MicrosoftDeveloperNetworkDevelopmentLibrary.Microsoft
Press(2000).
[Microsoft2000b]MicrosoftWindows2000 ServerResource Kit.MicrosoftPress
(2000).
[Microsystems1995]S.Microsystems,SolarisMultithreadedProgramming Guide,
PrenticeHall(1995).
[Milenkovic1987]M.Milenkovic,OperatingSystems:ConceptsandDesign,
McGraw-Hill(1987).
87 4Bibliography
[MillerandKatz1993]E.L.MillerandR.H.Katz,"AnAnalysiser fFile
MigrationinaUNIXSupercomputingEnvironment",ProceedingsoftheWinter
USEN1XConference(1993) ,pages421-434.
[Milojicicetal.2000]D.S.Milojicic,F.Douglis,Y.Paindaveine,R.Wheeler,and
S.Zhou,'"Proces sMigration",ACMComput.Sum,Volume32,Number3(2000) , pages241-299. [Mockapetris1987]P.Mockapetris,"DomainNames—ConceptsandFacili-ties",Network Working Group, Request for Comments: 1034(1987) .
[MohanandLindsay1983]C.MohanandB.Lindsay,"Efficien tCommitProto-colsfo rtheTreeofProcessesModelofDistributedTransactions",Proceedingsof theACM SymposiumonPrinciplesofDatabase Systems(1983) .
[Mo k1983]A.K.Mok."FundamentalDesignProblemsofDistributedSystems fo rtheHardReal-TimeEnvironment".Ph.D.thesis,MassachussettsInstituteof
Technology,Cambridge,MA(1983) .
[Morri s1973]J.H.Morris,"ProtectioninProgrammingLanguages",Communi-cationsoftheACM,Volume16,Number1(1973) ,pages15-21.
[Morri sandThompson1979]R.MorrisandK.Thompson,"PasswordSecurity:
ACaseHistory",CommunicationsoftheACM,Volume22,Number11(1979) , pages594-597. [Morri setal.1986]J.H.Morris,M.Satyanarayanan,M.H.Conner,J.H.
Howard,D.S.H.Rosenthal,andF.D.Smith,"Andrew:ADistributedPersonal
ComputingEnvironment",CommunicationsoftheACM,Volume29,Number3
(1986) ,pages184-201.
[Morshedian1986]D.Morshedian,"HowtoFightPasswordPirates",Computer,
Volume19,Number1(1986) .
[Motorol a1993]PowerPC601RISCMicroprocessorUser'sManual.MotorolaInc.
(1993) .
[Myer sandBeigl2003]B.MyersandM.Beigl,"HandheldComputing",Com-puter,Volume36,Number9(2003) ,pages27-29.
[Navarr oetal.2002]J.Navarro,S.Lyer,P.Druschel,andA.Cox,"Practical,
TransparentOperatingSystemSupportfo rSuperpages",Proceedingsofthe
USEN1XSymposiumonOperating Systems Design and Implementation(2002) .
[NeedhamandWalker1977]R.M.NeedhamandR.D.H.Walker,"TheCam-bridgeCAPComputerandItsProtectionSystem",ProceedingsoftheSixth
SymposiumonOperatingSystem Principles(1977) ,pages1-10.
[Nelsonetal.1988]M.Nelson,B.Welch,andJ.K.Ousterhout,"Cachinginthe
SpriteNetworkFileSystem",ACM TransactionsonComputerSystems,Volume6,
Number1(1988) ,pages134-154.
[NortonandWilton1988 ]P.NortonandR.Wilton,TheNeivPeterNortonPro-grammer'sGuidetotheIBMPC&PS/2,MicrosoftPress(1988) .
[Nutt2004]G.Nutt,OperatingSystems:A ModernPerspective,ThirdEdition,
Addison-Wesley(2004) . jBibliography875 [OaksandWong1999]S.Oaksan dH.Wong,JavaThreads,Second'Edition,
O'Reilly&Associates(1999).
[Obermarck1982]R.Obermarck,"Distribute dDeadlockDetectionAlgorithm",
ACMTransactionsonDatabaseSystems,Volume7,Number2(1982),page s
187-208.
>[O'LearyandKitts1985]B.T.O'Learyan dD.L.Kitts,"OpticalDevicefora
HMassStorageSystem",Computer,Volume18,Number7(1985).
[OlsenandKenley1989]R.P.Olsenan dG.Kenley,"VirtualOpticalDisksSolve th eOn-LineStorageCrunch",Computer Design,Volume28,Number1(1989), page s93-96.
[Organick1972]E.I.Organick,TheMulticsSystem:AnExaminationofItsStruc-ture,MITPress(1972).
[Ortiz2001]S.Ortiz,"Embedde dOSsGainth eInsid eTrack",Computer,Volume
34,Number11(2001).
[Ousterhout1991]J.Ousterhout."TheRoleofDistributedState".InCMU
ComputerScience:a25thAnniversaryCommemorative(1991),R.F.Rashid,
Ed.,Addison-Wesley(1991).
[Ousterhoutetal.1985]J.K.Ousterhout,H.D.Costa,D.Harrison,J.A.Kunze,
M.Kupfer,an dJ.G.Thompson,"ATrace-DrivenAnalysisofth eUNIX4.2BSD
FileSystem",ProceedingsoftheACMSymposiumonOperatingSystemsPrinciples
(1985),pages15-24.
[Ousterhoutetal.1988]J.K.Ousterhout,A.R.Cherenson,F.Douglis,M.N.
Nelson,an dB.B.Welch,"TheSpriteNetwork-OperatingSystem",Computer,
Volume21,Number2(1988),pages23-36.
[Parameswaranetal.2001]M.Parameswaran,A.Susarla,an dA.B.Whinston,
"P2PNetworking:AnInformation-Sharin gAlternative",Computer,Volume34,
Number7(2001).
[Parmeleeetal.1972]R.P.Parmelee,T.I.Peterson,C.C.Tillman,an dD.Hat-field,"VirtualStoragean dVirtualMachineConcepts",IBM SystemsJournal,
Volume11,Number2(1972),page s99-130.
[Parnas1975]D.L.Parnas,"OnaSolutiontoth eCigaretteSmokers'Problem i iWithoutConditionalStatements",CommunicationsoftheACM,Volume18,
£Number3(1975),pages181-183.
c
3[Patil1971]S.Patil."Limitationsan dCapabilitiesofDijkstra'sSemaphore
%PrimitivesforCoordinationAmongProcesses".TechnicalReport,MIT(1971).
|[Pattersonetal.1988]D.A.Patterson,G.Gibson,andR.H.Katz,"ACase
?forRedundantArraysofInexpensiv eDisks(RAID)",ProceedingsoftheACM sSIGMODInternationalConferenceontheManagementofData(1988). u
|[Peaseetal.1980]M.Pease,R.Shostak,an dL.Lamport,"ReachingAgreement sinth ePresenceofFaults",CommunicationsoftheACM,Volume27,Number2 g -(1980),pages228-234.
I
I
87 6Bibliography
[PechuraandSchoeffler1983]M.A.PechuraandJ.D.Schoeffler,"Estinfating
FileAccessTimeofFloppyDisks",CommunicationsoftheACM,Volume26,
Number10(1983),pages754-763.
[Perlman1988]R.Perlman,NetworkLayerProtocolswithByzantineRobustness.
PhDthesis,MassachusettsInstituteofTechnology(1988).
[Peterson1981]G.L.Peterson,'Myth sAboutth eMutualExclusionProblem",
InformationProcessingLetters,Volume12,Number3(1981).
[PetersonandDavie1996]L.L.PetersonandB.S.Davie,ComputerNetworks:a
SystemsApproach,MorganKaufmannPublishersInc.(1996).
[PetersonandNorman1977]J.L.PetersonandT.A.Norman,"BuddySys-tems" ,CommunicationsoftheACM,Volume20,Number6(1977),pages421-431.
[PfleegerandPfleeger2003]C.PfleegerandS.Pfleeger,SecurityinComputing,
ThirdEdition,PrenticeHall(2003).
[Philbinetal.1996]J.Philbin,J.Edler,O.J.Anshus,C.C.Douglas,an dK.Li,
"ThreadSchedulingforCacheLocality",ArchitecturalSupportforProgramming
Languagesand Operating Systems(1996),pages60-71.
[PinillaandGill2003]R.PinillaandM.Gill,"JVM:PlatformIndependen tvs.
PerformanceDependent",OperatingSystemReview(2003).
[PolychronopoulosandKuck1987]C.D.PolychronopoulosandD.J.Kuck,
"GuidedSelf-Scheduling:APracticalSchedulingSchemeforParallelSupercom-puters",IEEETransactionsonComputers,Volume36,Number12(1987),pages
1425-1439.
[Popek1974]G.J.Popek,"ProtectionStructures",Computer,Volume7,Number
6(1974),pages22-33.
[PopekandWalker1985]G.PopekandB.Walker,editors,TheLOCUSDis-tributedSystemArchitecture,MITPress(1985).
[PrieveandFabry1976]B.G.PrieveandR.S.Fabry,"VMIN—A nOptimal
VariableSpacePage-ReplacementAlgorithm",CommunicationsoftheACM,
Volume19,Number5(1976),pages295-297.
[PsaltisandMok1995]D.Psaltisan dF.Mok,"HolographicMemories",Scien-tificAmerican,Volume273,Number5(1995),pages70-76.
[Purdinetal.1987]T.D.M.Purdin,R.D.Schlichting,andG.R.Andrews,"A
FileReplicationFacilityforBerkeleyUNIX",Software—PracticeandExperience,
Volume17,(1987),pages923-940.
[Purdom,Jr .andStigler1970]P.W.Purdom,Jr.an dS.M.Stigler,"Statistical
PropertiesoftheBuddySystem",/.ACM,Volume17,Number4(1970),pages
683-697.
[Quinlan1991]S.Quinlan,"ACachedWORM",Software—PracticeandExperi-ence,Volume21,Number12(1991),pages1289-1299.
[Rago1993]S.Rago,UNIXSi/stemVNetwork Programming,Addison-Wesley
(1993).
Bibliography877
[Rashid1986]R.F.Rashid,"FromRIGtoAccenttoMach:TheEvolutionofa
NetworkOperatingSystem",ProceedingsoftheACM/IEEEComputerSociety,Fall
JointComputerConference(1986).
[RashidandRobertson1981]R.RashidandG.Robertson,"Accent:A
Communication-OrientedNetworkOperatingSystemKernel",Proceedingsof
theACMSymposiumonOperatingSystemPrinciples(1981).
[Raynal1986]M.Raynal,AlgorithmsforMutualExclusion,MITPress(1986).
[Raynal1991]M.Raynal,"ASimpleTaxonomyforDistributedMutualExclu-sionAlgorithms",OperatingSystems Review,Volume25,Number1(1991),pages
47-50.
[RaynalandSinghal1996]M.RaynalandM.Singhal,"LogicalTime:Capturing
CausalityinDistributedSystems",Computer,Volume29,Number2(1996),pages
49-56.
[ReddyandWyllie1994]A.L.N.ReddyandJ.C.Wyllie,"I/ Oissuesina
MultimediaSystem'",Computer,Volume27,Number3(1994),pages69-74.
[RedellandFabry1974]D.D.Redellan dR.S.Fabry,"SelectiveRevocation ofCapabilities",ProceedingsoftheIRIAInternationalWorkshoponProtectionin OperatingSystems(1974),pages197-210.
[Reed1983]D.P.Reed,"ImplementingAtomicActionsonDecentralizedData",
ACMTransactionsonComputerSystems,Volume1,Number1(1983),pages3-23.
[ReedandKanodia1979]D.P.ReedandR.K.Kanodia,"Synchronizationwith
EventcountsandSequences",CommunicationsoftheACM,Volume22,Number
2(1979),pages115-123.
[Regehretal.2000]J.Regehr,M.B.Jones,andJ.A.Stankovic,"Operating
SystemSupportforMultimedia:TheProgrammingModelMatters",Technical
ReportMSR-TR-2000-89,MicrosoftResearch(2000).
[Reid1987]B.Reid,"ReflectionsonSomeRecentWidespreadComputerBreak-Ins",CommunicationsoftheACM,Volume30,Number2(1987),pages103-105.
[RicartandAgrawala1981]G.RicartandA.K.Agrawala,"AnOptimalAlgo-rith mforMutualExclusioninComputerNetworks",CommunicationsoftheACM,
Volume24,Number1(1981),pages9-17.
[Richards1990]A.E.Richards,"AFileSystemApproachforIntegratin gRemov-ableMediaDevicesan dJukeboxes",OpticalInformationSystems,Volume10,
Number5(1990),pages270-274.
[Richter1997]J.Richter,AdvancedWindows,MicrosoftPress(1997).
[Riedeletal.1998]E.RiedeLG.A.Gibson,andC.Faloutsos,"ActiveStorage
forLarge-ScaleDataMiningandMultimedia",Proceedingsof24thInternational
ConferenceonVeryLargeDataBases(1998),pages62-73.
[Ripeanuetal.2002]M.Ripeanu,A.Immnitchi ,and1 .Foster,"Mappin gth e
GnutellaNetwork",IEEEInternetComputing,Volume6,Number1(2002).
[Rivestetal.1978]R.L.Rivest,A.Shamir,andL.Adleman,"OnDigitalSigna-ture sandPublicKeyCryptosystems",CommunicationsoftheACM,Volume21,
87 8Bibliography
Number2(1978),pages120-126.
[RodehefferandSchroeder1991]T.L.RodehefferandM.D.Schroeder,"Auto-maticreconfigurationinAutonet",ProceedingsoftheACMSymposiumonOperat-ingSystemsPrinciples(1991),pages183-97.
[RosenblumandOusterhout1991]M.RosenblumandJ.K.Ousterhout,"The
DesignandImplementatio nofaLog-StructuredFileSystem",Proceedingsofthe
ACMSymposiumonOperatingSystemsPrinciples(1991),pages1-15.
[Rosenkrantzetal.1978]D.J.Rosenkrantz,R.E.Stearns,andP.M.Lewis,
"SystemLevelConcurrencyControlforDistributedDatabaseSystems",ACM
TransactionsonDatabaseSystems,Volume3,Number2(1978),pages178-198.
[RuemmlerandWilkes1991]C.RuemmlerandJ.Wilkes."DiskShuffling".
TechnicalReport,Hewlett-PackardLaboratories(1991).
[RuemmlerandWilkes1993]C.Ruemmleran dJ.Wilkes,"UnixDiskAccess
Patterns",ProceedingsoftheWinterUSENIX Conference(1993),pages405-420.
[RuemmlerandWilkes1994]C.RuemmlerandJ.Wilkes,"AnIntroductio nto
DiskDriveModeling",Computer,Volume27,Number3(1994),pages17-29.
[Rushby1981]J.M.Rushby,"DesignandVerificationofSecureSystems",
ProceedingsoftheACMSymposiumonOperatingSystemsPrinciples(1981),pages
12-21.
[RushbyandRandell1983]J.Rushbyan dB.RandelL"ADistributedSecure
System",Computer,Volume16,Number7(1983),pages55-67.
[RussellandGangemi1991]D.RussellandG.T.Gangemi,ComputerSecurity
Basics,O'Reilly&Associates(1991).
[SaltzerandSchroeder1975]J.H.SaltzerandM.D.Schroeder,"TheProtection ofInformationinComputerSystems",ProceedingsoftheIEEE(1975),pages 1278-1308.
[Sandberg1987]R.Sandberg,TheSunNetworkFileSystem:Design,Implementa-tionand Experience,SunMicrosystems(1987).
[Sandbergetal.1985]R.Sandberg,D.Goldberg,S.Kleiman,D.Walsh,and
B.Lyon,"DesignandImplementatio nofth eSunNetworkFilesystem",Proceed-ingsoftheSummerUSENIXConference(1985),pages119-130.
[SargentandShoemaker1995]M.SargentandR.Shoemaker,ThePersonal
ComputerfromtheInsideOut,ThirdEdition,Addison-Wesley(1995).
[Sarisky1983]L.Sarisky,"WillRemovableHardDisksReplaceth eFloppy?",
Byte(1983),pages110-117.
[Satyanarayanan1990]M.Satyanarayanan,"Scalable,SecureandHighlyAvail-ableDistributedFileAccess",Computer,Volume23,Number5(1990),pages
9-21.
[Savageetal.2000]S.Savage,D.Wetherall,A.R.Karlin,andT.Anderson,
"PracticalNetworkSupportforIPTraceback",ProceedingsofACMSIGCOMM
ConferenceonDataCommunication(2000),pages295-306.
Bibliography87 9t
[Schell1983]R.R.Schell,"ASecurityKernelfo raMultiprocessorMicrocom-puter",Computer(1983) ,pages47-53.
[SchindlerandGregory1999]J.SchindlerandG.Gregory,"AutomatedDisk
DriveCharacterization",Technical Report, Carnegie-Mellon University(1999) .
[SchlichtingandSchneider1982]R.D.SchlichtingandF.B .Schneider,"Under-standingandUsingAsynchronousMessagePassingPrimitives",Proceedingsof theSymposiumonPrinciplesofDistributed Computing(1982) ,pages141-147.
[Schneider1982]F.B.Schneider,"SynchronizationinDistributedPrograms",
ACMTransactionsonProgrammingLanguages andSystems,Volume4,Number2
(1982) ,pages125-148.
[Schneier1996]B.Schneier,AppliedCryptography,SecondEdition,JohnWileyand
Sons(1996) .
[Schrag e1967]L.E.Schrage,"TheQueueM/G/IwithFeedbacktoLower
PriorityQueues",Management Science,Volume13,(1967) ,pages466-474.
[SchwarzandMattern1994]R.SchwarzandF.Mattern,"DetectingCausal
RelationshipsinDistributedComputations:InSearchoftheHolyGrail",
DistributedComputing,Volume7,Number3(1994) ,pages149-174.
[Seely1989]D.Seely,"PasswordCracking:AGameofWits",Communicationsof
theACM,Volume32,Number6(1989) ,pages700-704.
[Seltzeretal.1990]M.Seltzer,P.Chen,andJ.Ousterhout,"DiskScheduling
Revisited",Proceedingsofthe Whiter USENIX Conference(1990) ,pages313-323.
[Seltzeretal.1993]M.I.Seltzer,K.Bostic,M.K.McKusick,andC.Staelin,"An
ImplementationofaLog-StructuredFileSystemfo rUNIX",USENIXWinter
(1993) ,pages307-326.
[Seltzeretal.1995]M.I.Seltzer,K.A.Smith,H.Balakrishnan,J.Chang,
S.McMains,andV.N.Padmanabhan,"FileSystemLoggingversusClustering:
APerformanceComparison",USENIXWinter(1995) ,pages249-264.
[ShrivastavaandPanzieri1982]S.K.ShrivastavaandF.Panzieri,"TheDesign
ofaReliableRemoteProcedureCallMechanism",IEEETransactionsonComput-ers,VolumeC-31,Number7(1982) ,pages692-697.
[Silberschatzetal.2001]A.Silberschatz,H.F.Korth,andS.Sudarshan,Database
Si/stemConcepts, Fourth Edition,McGraw-Hill(2001) .
[Silverman1983 ]J.M.Silverman,"ReflectionsontheVerificationoftheSecurity ofanOperatingSystemKernel",ProceedingsoftheACMSymposiumonOperating SystemsPrinciples(1983) ,pages143-154.
[Silvers2000]C.Silvers,"UBC:AnEfficientUnifiedI/ OandMemoryCaching
Subsystemfo rNetBSD",USENIX Annual TechnicalConference—FREENIXTrack
(2000) .
[Simmons1979]G.J.Simmons,"SymmetricandAsymmetricEncryption",
ComputingSurveys,Volume11,Number4(1979) ,pages304-330.
[Sincerbox1994]G.T.Sincerbox,editor,SelectedPapersonHolographicStorage,
OpticalEngineeringPress(1994) .
88 0Bibliography
[Singhal1989]M.Singhal,"DeadlockDetectioninDistributedSystems'
1
,Com-puter,Volume22,Number11(1989),pages37-48.
[Sireretal.1999]E.G.Sirer,R.Grimm,A.J.Gregory,an dB.N.Bershad,
"DesignandImplementatio nofaDistributedVirtualMachineforNetworked
Computers",SymposiumonOperatingSystemsPrinciples(1999),pages202-216.
[Smith1982]A.J.Smith,"CacheMemories"',ACMComputingSurveys,Volume
14,Number3(1982),pages473-530.
[Smith1985]A.J.Smith,"DiskCache-MissRatioAnalysisandDesignConsid-erations",ACMTransactionsonComputerSystems,Volume3,Number3(1985), pages161-203. [Sobtietal.2004]S.Sobti,N.Garg,F.Zheng,J.Lai,Y.Shao,C.Zhang,E.Ziskind,
A.Krishnamurthy,andR.Wang,"Segank:ADistributedMobileStorageSys-tem"',ProceedingsoftheThirdUSENIXConference onFileandStorageTechnologies
(2004).
[Solomon1998]D.A.Solomon,InsideWindowsNT,Second Edition,Microsoft
Press(1998).
[SolomonandRussinovich2000]D.A.SolomonandM.E.Russinovich,Inside
MicrosoftWindows2000,ThirdEdition,MicrosoftPress(2000).
[Spafford1989]E.H.Spafford,"TheInterne tWorm:CrisisandAftermath",
CommunicationsoftheACM,Volume32,Number6(1989),pages678-687.
[SpectorandSchwarz1983]A.Z.SpectorandP.M.Schwarz,"Transactions:A
ConstructforReliableDistributedComputing",ACM SIGOPSOperatingSystems
Review,Volume17,Number2(1983),pages18-35.
[Stallings2000a]W.Stallings,Localand MetropolitanArea Networks,PrenticeHall
(2000).
[Stallings2000b]W.Stallings,OperatingSystems, FourthEdition,PrenticeHall
(2000).
[Stallings2003]W.Stallings,CryptographyandNetworkSecurity: Principles and
Practice,Third Edition,PrenticeHall(2003).
[Stankovic1982]J.S.Stankovic,"SoftwareCommunicationMechanisms:Pro-cedureCallsVersusMessages",Computer,Volume15,Number4(1982).
[Stankovic1996]J.A.Stankovic,"StrategicDirectionsinReal-TimeandEmbed-dedSystems'",ACMComputingSurveys,Volume28,Number4(1996),pages
751-763.
[Staunstrup1982]J.Staunstrup,"MessagePassingCommunicationVersusPro-cedureCallCommunication",Software—PracticeandExperience,Volume12,
Number3(1982),pages223-234.'
[Steinmetz1995]R.Steinmetz,"AnalyzingtheMultimediaOperatingSystem",
IEEEMulHMedia,Volume2,Number1(1995),pages68-84.
[Stephenson1983]C.J.Stephenson,"FastFits:ANewMethodforDynamic
StorageAllocation",ProceedingsoftheNinthSymposiumonOperatingSystems
Principles(1983),pages30-32.
Bibliography881
[Stevens1992]R.Stevens,Advanced Programming inthe UNIXEnvironment,
Addison-Wesley(1992).
[Stevens1994]R.Stevens,TCP/IPIllustratedVolume1:TheProtocols,Addison-Wesley(1994).
[Stevens1995]R.Stevens,TCP/IPIllustrated,Volume2:TheImplementation,
Addison-Wesley(1995),
[Stevens1997]W.R.Stevens,UNIXNetworkProgramming—VolumeI,Prentice
Hall(1997).
[Stevens1998]W.R.Stevens,UNIXNetworkProgramming—VolumeII,Prentice
Hall(1998).
[Stevens1999]W.R.Stevens,LfMXNetworkProgrammingInterprocessCommu-nications—Volume2,PrenticeHall(1999).
[Stoicaetal.1996]I.Stoica,H.Abdel-Wahab,K.Jeffay,S.Baruah,J.Gehrke,and
G.Plaxton,"AProportionalShareResourceAllocationAlgorithmforReal-Time,
Time-SharedSystems",IEEE Real-TimeSystemsSymposium(1996).
[Su1982]Z.Su,"ADistributedSystemforInternetNameService",Network
WorkingGroup,RequestforComments:830(1982).
[Sugermanetal.2001]J.Sugerman,G.Venkitachalam,andB.Lim,"Virtualizing
I/ ODevicesonVMwareWorkstatin'sHostedVirtualMachineMonitor',2001
USENIXAnnualTechnicalConference(2001).
[Sun1990]NetworkProgrammingGuide.SunMicrosystems(1990).
[Svobodova1984]L.Svobodova,"FileServersforNetwork-BasedDistributed
Systems",ACMComputing Survey,Volume16,Number4(1984),pages353-398.
[Tallurietal.1995]M.Talluri,M.D.Hill,andY.A.Khalidi,'" ANewPageTable for64-bitAddressSpaces",ProceedingsoftheACMSymposiumonOperating SystemsPrinciples(1995).
[TamchesandMiller1999]A.TamchesandB.P.Miller,"Fine-GrainedDynamic
Instrumentatio nofCommodityOperatingSystemKernels",USENIXSymposium onOperatingSystemsDesignand Implementation(1999).
[Tanenbaum1990]A.S.Tanenbaum,StructuredComputer Organization,Third
Edition,PrenticeHall(1990).
[Tanenbaum2001]A.S.Tanenbaum,ModernOperatingSystems,PrenticeHall
(2001).
[Tanenbaum2003]A.S.Tanenbaum,ComputerNetworks,FourthEdition,Prentice
Hall(2003).
[TanenbaumandVanRenesse1985]A.S.TanenbaumandR.VanRenesse,
"DistributedOperatingSystems",ACMComputingSurvey,Volume17,Number
4(1985),pages419^170.
[TanenbaumandvanSteen2002]A.TanenbaumandM.vanSteen,Distributed
Systems:PrinciplesandParadigms,PrenticeHall(2002).
88 2Bibliography
[TanenbaumandWoodhull1997]A.S.TanenbaumandA.S.Woodhull/Oper-atingSystemDesignandImplementation,SecondEdition,PrenticeHall(1997).
[Tate2000]S.Tate,Windows2000EssentialReference,NewRiders(2000).
[TayandAnanda1990]B.H.TayandA.L,Ananda,"ASurveyofRemote
ProcedureCalls",OperatingSystemsReview,Volume24,Number3(1990),pages
68-79.
[TeoreyandPinkerton1972]T.J.Teoreyan dT.B.Pinkerton,"AComparative
AnalysisofDiskSchedulingPolicies",CommunicationsoftheACM,Volume15,
Number3(1972),pages177-184.
[Tevanianetal.1987a]A.Tevanian,Jr.,R.F.Rashid,D.B.Golub,D.L.Black,
E.Cooper,andM.W.Young,"Mad iThreadsandth eUnixKernel:TheBattle forControl",ProceedingsoftheSummerUSENIXConference(1987). [Tevanianetal.1987b]A.Tevanian,Jr.,R.F.Rashid,M.W.Young,D.B.Golub,
M.R.Thompson,W.Bolosky,andR.Sanzi."AUNIXInterfaceforShared
Memoryan dMemoryMappedFilesUnderMach".TechnicalReport,Carnegie-MellonUniversity(1987).
[Tevanianetal.1989]A.Tevanian,Jr.,andB.Smith,"Mach:TheModelfor
FutureUnix",Byte(1989).
[Thekkathetal.1997]C.A.Thekkath,T.Mann,andE.K.Lee,"Frangipani:A
ScalableDistributedFileSystem",SymposiumonOperatingSi/stemsPrinciples
(1997),pages224-237.
[Thompson1984]K.Thompson,"ReflectionsonTrustingTrust",Communica-tionsofACM,Volume27,Number8(1984),pages761-763.
[Thorn1997]T.Thorn,"Programmin gLanguagesforMobileCode",ACM
ComputingSurveys,Volume29,Number3(1997),pages213-239.
[Toigo2000]J.Toigo,"AvoidingaDataCrunch"',ScientificAmerican,Volume
282,Number5(2000),pages58-74.
[Traigeretal.1982]I.L.Traiger,J.N.Gray,C.A.Galtieri,andB.G.Lindsay,
"TransactionsandConsistencyi nDistributedDatabaseManagementSystems",
ACMTransactionsonDatabaseSystems,Volume7,Number3(1982),pages
323-342.
[TuckerandGupta1989]A.TuckerandA.Gupta,"ProcessControland
SchedulingIssuesforMultiprogrammedShared-MemoryMultiprocessors",
ProceedingsoftheACMSymposiumonOperatingSystems Principles(1989).
[Tudor1995]P.N.Tudor."MPEG-2videocompressiontutorial" .IEEEColo-quiumonMPEG-2-WhatitisandWhatitisn' t(1995).
[Vahalia1996]U.Vahalia,UnixInternals:TheNeivFrontiers,PrenticeHall(1996).
[VeeandHsu2000]V.VeeandW.Hsu,""Locality-PreservingLoad-Balancing
MechanismsforSynchronousSimulationsonShared-MemoryMultiproces-sors",ProceedingsoftheFourteenthWorkshoponParallelandDistributedSimulation
(2000),pages131-138.
[Venners1998]B.Venners,InsidetheJavaVirtualMachine,McGraw-Hill(1998).
Bibliography88 3
[Wah1984]B.W.Wah,"FilePlacementonDistributedComputerSystems",
Computer,Volume17,Number1(1984),pages23-32.
[Wahbeetal.1993a]R.Wahbe,S.Lucco,T.E.Anderson,andS.L.Graham,
"EfficientSoftware-BasedFaultIsolation",ACMSIGOPSOperatingSystems
Reviezv,Volume27,Number5(1993),pages203-216.
[Wahbeetal.1993b]R.Wahbe,S.Lucco,T.E.Anderson,an dS.L.Graham,
"EfficientSoftware-BasedFaultIsolation",ACMSIGOPSOperatingSystems
Review,Volume27,Number5(1993),pages203-216.
[Wallachetal.1997]D.S.Wallach,D.Balfanz,D.Dean,an dE.W.Felten,
"ExtensibleSecurityArchitecturesforJava",ProceedingsoftheACM Symposium onOperatingSystemsPrinciples(1997). [Wilkesetal.1996]J.Wilkes,R.Golding,C.Staelin,andT.Sullivan,"TheHP
AutoRAIDHierarchicalStorageSystem",ACMTransactionsonComputerSystems,
Volume14,Number1(1996),pages108-136.
[Williams2001]R.Williams,Computer SystemsArchitecture—ANetworking
Approach,Addison-Wesley(2001).
[Williams2002]N.Williams,"AnImplementatio nofSchedulerActivations onth eNetBSDOperatingSystem",2002USENIXAnnualTechnical Conference,
FREENIXTrack(2002).
[Wilsonetal.1995]P.R.Wilson,M.S.Johnstone,M.Neely,an dD.Boles,
"DynamicStorageAllocation:ASurveyandCriticalReview",Proceedingsof
theInternationalWorkshoponMemoryManagement(1995),pages1-116.
[Wolf2003]W.Wolf,"ADecadeofHardware/SoftwareCodesign",Computer,
Volume36,Number4(2003),pages38-43.
[WoodandKochan1985]P.WoodandS.Kochan,UNIXSi/stemSecurity,Hay-den(1985).
[Woodside1986]C.Woodside,"ControllabilityofComputerPerformance
TradeoffsObtainedUsingControlled-ShareQueueSchedulers",IEEETransac-tionsonSoftivarcEngineering,VolumeSE-12,Number10(1986),pages1041-1048.
[Worthingtonetal.1994]B.L.Worthington,G.R.Ganger,andY .N.Patt,
"SchedulingAlgorithmsforModernDiskDrives",ProceedingsoftheACM
SigmetricsConferenceonMeasurementandModelingofComputerSystems(1994), pages241-251. [Worthingtonetal.1995]B.L.Worthington,G.R.Ganger,Y.N.Patt,and
J.Wilkes,"On-LineExtractionofSCSIDiskDriveParameters",Proceedingsof
theACMSigmetrics ConferenceonMeasurementand ModelingofComputerSystems
(1995),pages146-156.
[Wulf1969]W.A.Wulf,"PerformanceMonitorsforMultiprogrammingSys-tems" ,ProceedingsoftheACMSymposiumonOperatingSystems Principles(1969), pages175-181. [Wulfetal.1981]W.A.Wulf,R.Levin,andS.P.Harbison,Hydra/C.mmp:An
ExperimentalComputerSystem,McGraw-Hill(1981).
88 4Bibliography
[Yeongetal.1995]W.Yeong,T.Howes,andS.Kille,'"Lightweigh tDfrectory
AccessProtocol",NetworkWorkingGroup,RequestforComments:1777(1995).
[Youngetal.1987]M.Young,A.Tevanian,R.Rashid,D.Golub,andJ.Eppinger,
"TheDualityofMemoryandCommunicationinth eImplementatio nofaMul-tiprocessorOperatingSystem",ProceedingsoftheACMSymposiumonOperating
SystemsPrinciples(1987),pages63-76.
[Y uetal.2000]X.Yu,B.Gum,Y.Chen,R.Y.Wang,K.Li,A.Krishnamurthy,and
T.E.Anderson,"TradingCapacityforPerformanceinaDiskArray",Proceedings
ofthe2000SymposiumonOperatingSystemsDesign andImplementation(2000),
pages243-258.

Similar Documents

Premium Essay

Operating System

...Intercontinental University * Leonel A Silvestre * ITCO211 * File System Hi As your help desk technician I will do everything we can to help you with the operating system problem. Everybody knows what is a Hard Disk or Hard Drive let me refresh your mind, with a simple explanation: Hard Disk/ Drive, is a device for storing and retrieving digital information, primarily computer data. It consists of one or more rigid rapidly rotating discs (platters) coated with magnetic material, and with magnetic heads arranged to write data to the surfaces and read it from them. With that been said, now move forward with Operating System and Hard Disk/ Drive. I would like to recommend you the best operating system is DOS (Disk Operating System), why? Because has everything you need. Let me tell you a little more about DOS. Disk Operating System: Most often abbreviated as DOS, refer to operating system software used in most computers that provides the abstraction and management of secondary storage devices and the information on them (e.g., file systems for organizing files of all sorts). Such software is referred to as a disk operating system when the storage devices it manages are made of rotating platters, such as floppy disks or hard disks. In the early days of microcomputers, computer memory space was often limited, so the disk operating system was an extension of the operating system. This component was only loaded if needed. Otherwise, disk access would be...

Words: 1780 - Pages: 8

Premium Essay

Operating Systems

...NT1110_StudentName_Module1_Lab.doc 3/21/15 An operating system takes input in the form of zeros and ones -- bits -- and runs them through various circuits and processors, the hardware behaves according to built in rules. We define these rules using gates, which take input and produce an output in a structured way. The operating system allows complex programs to access hardware to get results. Only the hardware's physical properties can limit what programs can do. You could design an operating system by physically programming it into a computer's circuits. This would require building electrical pathways using millions of gates. But such an operating system would be slow and you would need the patience of Jonah to use it. That's why operating systems like Mac OS X and Windows are software. Software is flexible and hardware is not -- you can make changes to software with updates. To do the same with hardware would mean switching out physical chips and circuit boards. Operating systems are like the manager for a computer, it’s the job of the OS to monitor what software needs and what the hardware can provide. When you run applications on your computer, the OS allocates the resources necessary to complete the task. That can include processing power, memory and computer storage access, among other things. Ideally the OS will make sure that your computer's hardware is never overtaxed. ...

Words: 705 - Pages: 3

Free Essay

Operating Systems

...ZETECH UNIVERSITY NAME: RUTERE JOAN WANJA REG. NO: DBIT-02-0035/2015 SCHOOL: I.T COURSE: DBIT UNIT NAME: OPERATING SYSTEMS TASK: CAT 2 LECTURER: MR FRED 1. Context Switching It is the process of storing of storing and restoring the state (context) of a process or thread so that the execution can be resumed from the same point at a later time. There are three potential triggers for a context switch: • Multitasking: Most commonly, within some scheduling scheme, one process needs to be switched out of the CPU so another process can run.This context switch can be triggered by the process making itself unrunnable, such as by waiting for an I/O or synchronization operation to complete. On a pre-emptive multitasking system, the scheduler may also switch out processes from being starved of CPU time, preemptive schedulers often configure a timer interrupt to fire when a process exceeds its time slice.This interrupt ensures that the scheduler will gain control to perform a context switch. • Interrupt Handling Modern architectures are interrupt driven.This means that if the CPU requests data from a disk, for example, it does not need to busy-wait until the read is over, it can issue the request and continue with some other execution. When the read is over, the CPU can be interrupted and presented with the read. For interrupts, a program called an interrupt handler that handles the interrupt from the disk. When an interrupt occurs...

Words: 991 - Pages: 4

Free Essay

Operating Systems

...Researching operating systems I am choosing Windows XP for the basic low end computer because the system requirements are fairly low and it will work on just about any personal computer that is being used today. The operating system I am choosing for the high end computer is Windows 7. Its requirements are tailor-made more for the newer and higher end computers. Some of the computers that are out there will not be able to run windows 7. Windows XP system requirements are a Pentium 233 megahertz processor, at least 64 megabytes of system memory, at least 1.5 gigabytes of hard disk space, CD-ROM or DVD drive, video adaptor, and a monitor with a screen resolution of 800x600 or higher. Windows XP doesn’t have a very memory intensive graphical user interface either. If you are upgrading from Windows 2000 you probably won’t notice too much of a difference as far as the general look and feel of the operating system. You will have to activate it soon after you install the program to keep it from deactivating. Windows XP also has better security and protection than previous versions. Windows 7 system requirements are 1 gigahertz or faster processor, 1 gigabyte of system memory for 32 bit systems and 2 gigabytes of system memory for 64 bit systems, 16 gigabytes of hard disk space for 32 bit systems and 20 gigabytes of hard disk space for 64 bit systems, support for DirectX 9 with windows display driver model 1.0 and 128 megabytes of memory for the Aero theme desktop, a monitor...

Words: 534 - Pages: 3

Free Essay

Operating Systems

...Operating Systems Vulnerabilities NAME POS 355 18 Mar 15 Carol Eichling Operating Systems Vulnerabilities As the reported number of security vulnerabilities continued to spike in the 20th century let us define a security flaw. A security flaw according to "Apple Security Flaw: What You Need To Know" (2014), "The flaw is in the way the operating system provides the essential services, known as secure sockets layer (SSL) or transport layer security (TLS). These two layers of security allow information to be transmitted worry-free between browsers and web servers, or between a mail server and mail client. SSL is in the form of encryption, which scrambles data sent over a network to keep it private. The second layer involves verification that the server is authentic." With the heighten computer security regarding vulnerabilities, the increase of user awareness and training users to not click on particular links is difficult yet feasible. Although most operating system has computer security protection, the tasks of protecting the systems from vulnerabilities are a daunting task because the operating systems are unique. Security flaw in Microsoft and Mac OS X® A known security flaw in Windows is called the Freak. The Freak security flaw allowed hackers to create a simulated middle person attacks on the encrypted secure sockets layer and transport layer of a security connections. It was discovered that hackers could force websites to weaken the system encryption...

Words: 843 - Pages: 4

Premium Essay

Operating Systems

...Operating systems What an operating system does The operating system is software, an operating system makes a computer come alive. When a computer is first built it is effectively cut-off from the world as it cannot receive input or provide output. Without an operating system a computer cannot work efficiently. The operating system has three main tasks to do:  Manage the computer resources: Input and output functions of the computer are controlled by the operating system. The operating system has to manage the CPU, how memory is allocation , access to disk drives, and many other tasks.  Interact with the user: All computers need someone to interact with it, to control it . It is the operating system's task to provide a means of doing this which is easy, consistent, flexible and structured. An operating system also allows the user of the computer to make changes as well.  Run applications: Application packages, such as word processors or spreadsheets, are what most users use on their computers, for most it is essential for their daily use of computers . The operating system provides a means of executing them, and provides the programs with tools and services. These include commands from retrieving data from a hard disk, or even to send data to a printer. LINUX The history of Linux began in 1991 with the commencement of a personal project by a student who was called Linus Torvalds. He studied at the University or Helsinki and this is where he created the...

Words: 293 - Pages: 2

Premium Essay

Operating System

...------------------------------------------------- BCN 2053 – OPERATING SYSTEMS – Assignment 1 ------------------------------------------------- Top of Form INSTRUCTIONS – Detail instructions is given below, please follow accordingly. This assignment carries a total of 10 marks. When we talk about operating systems, the most popular words are Windows and Linux. This assignment is all about exploring both types of operating systems. Each group require to: 1. Draw and explain in brief the evolution of both operating systems from the beginning up to today. Explanations may include : a. Year of release b. Version release c. Features 2. Compare between this two very popular Operating Systems, Windows VS Linux in terms of : a. Memory management 1. Focus on how both operating systems handle their memory management especially on virtual memory. To support your research, you may include relevant scenario of how memory being access. 2. Explain any limitation of maximum or minimum memory required by each operating systems especially on 64bit or 32bit architecture 3. Compare and recommend which operating systems utilize its memory more efficient in terms of: i. Normal usage (everyday usage by normal user) ii. Server usage (server environment) b. Process management 4. Focus on how both operating systems handle their process management when it comes to many processes request for CPU resources. You...

Words: 486 - Pages: 2

Premium Essay

Operating Systems

...Operating Systems Christy Kegley IT/282 3/2/2014 Carlton Foster Operating Systems * Provide a brief history of three operating systems. The top three operating systems are; Windows XP, Windows Vista, and Linux. “Windows XP is the first Windows OS to allow multiple users to log on simultaneously to the OS, each with their own applications open. Although Windows XP was first released with some bugs, the second service pack (Service Pack 2) resolved most of these problems. XP underwent three service packs. It is an extremely stable OS and was popular in both the home and corporate markets” (Guide to Managing and Maintaining Your PC, Eighth Edition, Andrews, pg. 1116). This programs allows users to do many things that others might not allow like older versions of Windows. Windows Vista is the newest version of Windows. This program is not very popular with some people because there is a lack of compatibility with other programs, also it slows performance. “The first problem is partly caused by hardware manufacturers not providing Vista drivers for their devices that were originally sold with XP drivers. The second problem means that many low end desktop and laptop computers can’t run Vista. And the slow performance of Vista is partly due to the many unnecessary features (fluff) it offers; these features weigh heavy on system resources. Vista comes in five versions: Windows Vista Home Basic, Home Premium, Business, Enterprise, and Ultimate. (Vista Starter...

Words: 764 - Pages: 4

Premium Essay

Operating Systems

...DENIS In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. What are two such problems? A time sharing environment or multi programming is one in which a computer system provides direct communication between the user and the system. It allows many users to share the computer at the same time. One of the problems that may result from the fact that resources are being shared is information theft, this is because all the users are able to access the files that are being shared on the system and so one can easily copy a file and modify it without the knowledge of all the other parties. Such scenarios can result into loss of security confidentiality and integrity since the owner of a file Without being aware of the system used as time-sharing and multiprogramming, may insert or have a secret or confidential data that he wants to remain at the file and also other users may change, add, or even remove some information in the file if they want to, since they have access to all files running on the system The other problem resulting from using such systems is the fact that there could be loss of storage space. Since users have equal privileges to create and access files on the system, then there could be a possibility that the users will create numerous files and eat up the storage space on the system without the other users’ knowledge, so as time goes by, each user will occupy some...

Words: 1053 - Pages: 5

Premium Essay

Operating Systems

...The purpose and function of an operating system is, to manage software that manages the computer hardware and software resources. It also provides common services for the computer programs, an operating system is a vital part of a computer system, and most applications require an operating system. An operating system acts as a middle component between the applications and you the person who is using it, and the hardware or applications that are trying to perform any function. An operating systems starts when, you first turn on your computer and ends when you turn your computer off. Some of the functions of an operating system are, booting your computer up, an operating system manages input and output devices that you are using on your computer. An operating system also provides a graphical user interface to create a user- friendly environment for the person who is running the operating system. An operating system also manages system resources and manages data. One difference among Windows, Linux, and Mac OS X operating systems is, Mac OS X operating system is, Mac OS is the operating system used by apple for their Macintosh computers. Mac OS has an Intel processors however, it is not compatible with regular PC-hardware and PC- based operating systems, such as windows or Linux. A second difference among Windows, Linux, and Mac OS X operating system is, Linux is an open source program that is ever expanding. This means anyone is able to change it if they have the knowledge...

Words: 557 - Pages: 3

Free Essay

Operating Systems

...Operating Systems Brittany E. Best Dr. Biswajit Panja Strayer University CIS 155 December 10, 2011   Operating System You may have heard of UNIX, or maybe not. Where did this so called UNIX come from? What exactly is an operating system you ask and what is it comprised of? Read on to find out more. Birth of a New Creation: UNIX is the creation and brain child of Bell Laboratory researchers Dennis Ritchie and Ken Thompson. Ken Thompson was working with Space Travel. Space Travel was a program that simulated the motion of the planets in our solar system. The Space Travel program was under the operating system called Multics (Multics is one of the first operating systems that provided a multiuser environment, and ran on a General Electric 6000 Electric Computer) (Afzal, 2008). Multics was a slow and very large and required a substantial amount of computer resources. Ken Thompson found a small little PDP-7 computer (created by the...

Words: 1257 - Pages: 6

Premium Essay

Operating Systems

...Paper: Operating Systems Analysis Paper POS/355 November 7, 2011 Jeff Rugg Introduction The operating system, commonly known as OS, is the brain or the center of all computer systems. It controls the input/output and controls various tasks of the hardware. Apart from serving as a go-between for application programs and the hardware of the computer, the OS also consists of information and programs while providing general services to make sure that several software applications can operate accordingly. Operating systems can be found in almost any type of a computer device such as personal computers, supercomputers, cellular telephones, and video game consoles as stated by Linux Systems (2011). As the research was being conducted for this paper, it raised a question whether the internet uses the operating system? It proved to be a challenge to actually pin point the most common operating systems on the Internet, but as the research continued, it was obvious that these three, Windows, Mac OS X, and Linux are considered to be the most common operating systems used on the Internet today. Background of each Operating System Windows Privately owned operating systems, Microsoft Windows is generally used on personal computers and as of today, the most commonly used version is Windows XP with the new version of Windows 7 for personal computers and Windows Server 2008 R2 for servers is entering the market. Mac OS X Mac OS X is a graphical operating system which is...

Words: 1150 - Pages: 5

Premium Essay

Operating System

...Program Execution The purpose of a computer systems is to allow the user to execute programs. So the operating systems provides an environment where the user can conveniently run programs. The user does not have to worry about the memory allocation or multitasking or anything. These things are taken care of by the operating systems. Running a program involves the allocating and deallocating memory, CPU scheduling in case of multiprocess. These functions cannot be given to the user-level programs. So user-level programs cannot help the user to run programs independently without the help from operating systems. I/O Operations Each program requires an input and produces output. This involves the use of I/O. The operating systems hides the user the details of underlying hardware for the I/O. All the user sees is that the I/O has been performed without any details. So the operating systems by providing I/O makes it convenient for the users to run programs. For efficiently and protection users cannot control I/O so this service cannot be provided by user-level programs. File System Manipulation The output of a program may need to be written into new files or input taken from some files. The operating systems provides this service. The user does not have to worry about secondary storage management. User gives a command for reading or writing to a file and sees his her task accomplished. Thus operating systems makes it easier for user programs to accomplished their task. This...

Words: 557 - Pages: 3

Premium Essay

Operating Systems

...Operating Systems Paul Cannizzaro Jr NT1110 Week One Short Answer THE PURPOSE AND FUNCTION OF AN OPERATING SYSTEM The purpose of an operating system is to provide a user interface as well as be the broker between software applications and a computer’s hardware (Rager 2013). According to Rager (2013) at a basic level operating systems allow a computer to complete simple tasks, such as connecting to a keyboard or mouse, maintaining files on a hard drive, or managing connected devices such as a printer. An operating system will make a computer secure to each different user and user specific by requiring a password for each user. DIFFERENCES BETWEEN WINDOWS, MAC OS X, AND LINUX Microsoft Windows is the most preferred operating system among computer users. Microsoft Windows consists of different operating systems developed and sold by Microsoft. Windows is available on desktops, laptops, phones, servers, and tablets. The first Microsoft operating system was released in 1985 and MS-DOS was the only Graphical User Interface. The small Microsoft Company skyrocketed through the 90's and millennium with the massive growth of computers around the workplace and eventually at home. The latest Microsoft Windows operating system is Microsoft Windows 10 and was released in late 2014. Many desktops and laptops received a free upgrade courtesy of Microsoft. Microsoft 10 upgraded to stylish icons like Mac OSX. The Mac OS X is Apple specific...

Words: 483 - Pages: 2

Premium Essay

Operating Systems

...Troubleshooting Operating Systems Arron CIS/296 Febuary 15, 2016 Steven Kernan Troubleshooting Operating Systems I have recently started in a new technical support role within the IT department of a major manufacturing organization. I am going to go through two scenarios in which I will help callers with problems occurring while using Windows XP and Windows Vista. The organization I am a part of doesn’t have a standard operating system in use. There are numerous products and versions in use across the whole company. I am going to discuss which of the operating systems I would recommend that the company makes standard between Windows XP and Windows Vista. I will also make a recommendation of which of the operating systems I would replace if I was in charge of the organization. My first scenario is that I receive a call from a user that using a Windows XP operating system and has encountered stability problems. The first thing I am going to do in order to gain more knowledge of the problem at hand is investigate the situation. I need this knowledge so I can properly troubleshoot the problem the user is having with the operating system they are using. The second thing I will do is establish a theory from the information I got from interviewing the user then I will test my theory. If my theory isn’t accurate then I will rethink the problem and figure out what occurring symptoms could be caused by, if my theory is correct I will resolve the problem. Taking preventative measures...

Words: 1538 - Pages: 7