You searched for subject:(Operating systems)
.
Showing records 1 – 30 of
698 total matches.
◁ [1] [2] [3] [4] [5] … [24] ▶

University of Victoria
1.
Horie, Michael.
On secure, dynamic customizing of a meta-space-based operating system.
Degree: Department of Computer Science, 2017, University of Victoria
URL: https://dspace.library.uvic.ca//handle/1828/8736
► Continuing advances in hardware and in software applications are pushing traditional operating systems beyond their limits. This is largely due to the fact that these…
(more)
▼ Continuing advances in hardware and in software applications are pushing traditional
operating systems beyond their limits. This is largely due to the fact that these advances,
and their associated requirements, were not foreseen at
operating system design time.
This becomes particularly apparent with multimedia applications, whose demands for
guaranteed quality of service differ considerably from those of most traditional applications.
To ensure that many future requirements will be met, along with many existing
demands, one solution is to allow applications to customize their
operating system
throughout its life-time. However, opening up an
operating system to application-initiated
changes can compromise the integrity of the system, suggesting the need for a security
model. Like any other aspect of a customizable system, such a security model
should be securely customizable, too. Therefore, this dissertation introduces MetaOS, a
securely- and dynamically-customizable
operating system which has a securely- and
dynamically-customizable security model.
MetaOS employs four types of building blocks: meta-levels, meta-spaces, meta-objects,
and meta-interfaces. Meta-levels localize customizable system services. Meta-spaces
act as firewalls which prevent custom alterations from affecting unrelated meta-spaces
and their applications. Meta-objects help to modularize meta-spaces into
smaller, easier-to-maintain components. Finally, meta-interfaces provide the heart of the
secure customizing model. MetaOS meta-interfaces are strictly divided into declarative and imperative interfaces,
providing a basis on which to distinguish between calls which only affect the
invoking application (i.e., local-effect calls), and calls which could affect other applications
as well (i.e., meta-space-wide-effect calls). By giving free access to the former, but
limiting access to the latter, a basic balance between flexibility and security can be
struck. Additional flexibility is achieved by allowing new local and meta-space-wide-effect
calls to be added dynamically, by permitting untrusted applications to negotiate
changes with trusted meta-space managers, and by allowing untrusted applications to
migrate to cloned meta-spaces and alter them as necessary.
Advisors/Committee Members: Manning, Eric (supervisor), Shoja, Gholamali C. (supervisor).
Subjects/Keywords: Operating systems (Computers)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Horie, M. (2017). On secure, dynamic customizing of a meta-space-based operating system. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8736
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Horie, Michael. “On secure, dynamic customizing of a meta-space-based operating system.” 2017. Thesis, University of Victoria. Accessed January 21, 2021.
https://dspace.library.uvic.ca//handle/1828/8736.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Horie, Michael. “On secure, dynamic customizing of a meta-space-based operating system.” 2017. Web. 21 Jan 2021.
Vancouver:
Horie M. On secure, dynamic customizing of a meta-space-based operating system. [Internet] [Thesis]. University of Victoria; 2017. [cited 2021 Jan 21].
Available from: https://dspace.library.uvic.ca//handle/1828/8736.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Horie M. On secure, dynamic customizing of a meta-space-based operating system. [Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8736
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cornell University
2.
Williams, Daniel.
Towards Superclouds.
Degree: PhD, Computer Science, 2013, Cornell University
URL: http://hdl.handle.net/1813/33842
► Cloud computing has emerged as an economically attractive utility model for computational resources. An increasing number of industries, from businesses to governments, are embracing cloud…
(more)
▼ Cloud computing has emerged as an economically attractive utility model for computational resources. An increasing number of industries, from businesses to governments, are embracing cloud computing. However, the economic benefits of the cloud computing model come at a price: the loss of control over how services and applications can use computing resources. In other words, cloud computing is fundamentally provider-centric. Cloud providers (the providers of computational resources), not cloud users (the consumers of computational resources), dictate rules and policies governing how computational resources can be used. For large enterprise application workloads, adhering to cloud provider rules and policies may be prohibitive. This dissertation explores the question: how can large enterprise workloads efficiently utilize and control computational resources from a variety of providers in the cloud computing model? The main contributions of this dissertation relate to a fundamental change to the cloud computing model. Instead of a provider-centric model, we propose a user-centric model in which the cloud user can maintain control over how computational resources obtained from cloud providers can be used. We have devised a new abstraction, called cloud extensibility, to enable the implementation of provider-level functionality by cloud users. Leveraging cloud extensibility, we describe steps towards a user-centric cloud computing model that grants cloud users-including large enterprises-control over resources obtained from one or more cloud providers. We call this new model the supercloud model. More specifically, we focus on three key areas in which current providercentric cloud computing models do not expose the necessary control or lack the features to support large enterprise workloads without significant reconfiguration effort. First, clouds are not interoperable, restricting workloads to a single provider and hindering incremental migration to the cloud. Second, clouds lack support for complex enterprise network configurations, including flow policies between application components and low-level network features (e.g., IP addresses, multicast, VLANs). Finally, high utilization of cloud resources cannot be applied through techniques like oversubscription, and existing techniques do not apply well to common workload patterns. We subsequently make three contributions, embodied in the design, implementation and evaluation of three
systems that leverage cloud extensibility. Cloud extensibility itself is instantiated in the first system, a nested virtualization layer called the Xen-Blanket. The Xen-Blanket additionally enables cloud interoperability by homogenizing existing cloud interfaces and services. The second system, VirtualWire, provides a virtual network abstraction to support complex enterprise networks in which the cloud user manages the network control logic. Finally, we present Overdriver, a system that enables high resource utilization through memory oversubscription and the handling of the resulting-often…
Advisors/Committee Members: Weatherspoon, Hakim (chair), Pond, Steven F. (committee member), Myers, Andrew C. (committee member).
Subjects/Keywords: Cloud Computing; Virtualization; Operating Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Williams, D. (2013). Towards Superclouds. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/33842
Chicago Manual of Style (16th Edition):
Williams, Daniel. “Towards Superclouds.” 2013. Doctoral Dissertation, Cornell University. Accessed January 21, 2021.
http://hdl.handle.net/1813/33842.
MLA Handbook (7th Edition):
Williams, Daniel. “Towards Superclouds.” 2013. Web. 21 Jan 2021.
Vancouver:
Williams D. Towards Superclouds. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/1813/33842.
Council of Science Editors:
Williams D. Towards Superclouds. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33842

University of Central Lancashire
3.
Ogbuke, Nnamdi Johnson.
The role of technology in outsourcing practices in the oil and gas industry.
Degree: PhD, 2019, University of Central Lancashire
URL: http://clok.uclan.ac.uk/30816/
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.797893
► This study examines the role of technology in outsourcing practices in the oil and gas industry. The aim is to verify the association between technology…
(more)
▼ This study examines the role of technology in outsourcing practices in the oil and gas industry. The aim is to verify the association between technology and outsourcing and their relevance as solution enablers that organisations within oil and gas sector should employed to facilitate future growth. The study assesses how firms benefit from outsourcing practices as a growth strategy to achieve competitive advantage. The resource-based view (RBV) theory was adopted as the main organisational theory that underpins this study. The theory justify outsourcing and technology through resource-related advantages and capabilities. More so, the resource-based view supports the idea that firms can strengthen their internal operations to achieve superior performance by exploiting external outsourcing arrangements through access to new technologies. These enablers are considered as the main source of firm's sustainable competitive advantage when they are valuable, rare, imperfectly imitable and non- substitutable. Comprehensive reviews were carried out on the evolution and current state of outsourcing practices, as well as new technologies to determine their impacts in driving performance within oil and gas industry. In attempt to answer the research questions, a self-administered questionnaire was adopted. A total of 200 administered questionnaires were sent to Nigerian oil and gas companies. Out of 200 questionnaires sent, 120 were returned which amount to 60% response rate. From the 120 questionnaires received, only 100 were considered valid for further analysis. Explorative interviews were conducted to validate the findings from the surveyed data. The interviews results also provided further clarity and understanding, in terms of operational frameworks, additional measures and contextual definitions, which the participants consider important beyond those obtained from the literature. The outcomes of the survey clarify the impacts of outsourcing technology in oil and gas industry with a view to how this affected the long-term business performance of the organisations. The study identified that the most important drivers of outsourcing practices in oil and gas industry is access to new technologies. Additionally, a moderating construct that was linked to the deployed technologies and outsourcing drivers provided further enhanced performance measures. The evidence shown that in addition to performance advantage of having access to enabling technologies and outsourcing initiatives, organisations' competitive performance can be further enhanced through the trio of effective quality management, expertise best practices and modern infrastructure. The implication of this research may demonstrates that implementation of outsourcing initiatives and technology solutions will be a significant growth strategy, particularly to SMEs, and may also provide economic opportunities that are not sufficiently available in most developing oil and gas economies.
Subjects/Keywords: Operating systems; Transport logistics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ogbuke, N. J. (2019). The role of technology in outsourcing practices in the oil and gas industry. (Doctoral Dissertation). University of Central Lancashire. Retrieved from http://clok.uclan.ac.uk/30816/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.797893
Chicago Manual of Style (16th Edition):
Ogbuke, Nnamdi Johnson. “The role of technology in outsourcing practices in the oil and gas industry.” 2019. Doctoral Dissertation, University of Central Lancashire. Accessed January 21, 2021.
http://clok.uclan.ac.uk/30816/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.797893.
MLA Handbook (7th Edition):
Ogbuke, Nnamdi Johnson. “The role of technology in outsourcing practices in the oil and gas industry.” 2019. Web. 21 Jan 2021.
Vancouver:
Ogbuke NJ. The role of technology in outsourcing practices in the oil and gas industry. [Internet] [Doctoral dissertation]. University of Central Lancashire; 2019. [cited 2021 Jan 21].
Available from: http://clok.uclan.ac.uk/30816/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.797893.
Council of Science Editors:
Ogbuke NJ. The role of technology in outsourcing practices in the oil and gas industry. [Doctoral Dissertation]. University of Central Lancashire; 2019. Available from: http://clok.uclan.ac.uk/30816/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.797893

Penn State University
4.
Enck, William Harold.
Analysis Techniques for Mobile Operating System Security
.
Degree: 2011, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/11817
► Devices such as smartphones running mobile operating systems have become an integral part of society. Current smartphones are a response to the Internet's influence on…
(more)
▼ Devices such as smartphones running mobile
operating systems have become an integral part of society. Current smartphones are a response to the Internet's influence on computing technology: devices provide nearly pervasive access to information and commoditize a seemingly endless number of services. However, smartphones are more than ultra-portable Web browsers. They combine the expanse knowledge and information available on the Internet with local context made accessible through hardware features such as GPS receivers, microphones, cameras, and accelerometers. In the past several years, smartphone innovation and popularity has surged in response to more open programming interfaces and network capabilities. Underlying this valuable innovation lies increased security risk for users and providers of content and cellular service.
In this dissertation, we explore the limitations of existing mobile
operating systems to protect end users from undesirable behavior by downloaded applications. Existing security frameworks define security policy in terms of permissions. We use requested permissions to focuses security analysis of available applications. First, we consider which permissions applications request and show that this limited information can prevent applications with dangerous functionality from being installed. Second, we consider what applications do with permissions. We design and build a framework for realtime dynamic taint analysis to identify misuse of information such as location and phone identifiers. Finally, we consider what applications can do with permissions based on implemented functionality. In doing so, we use several types of source code analysis to identify both dangerous behavior and vulnerabilities in decompiled applications. While we find the coarseness of permissions to be insufficient in several cases, the permission-based model fundamentally aided our analysis, demonstrating new potential for protecting future mobile platforms.
Advisors/Committee Members: Patrick Drew Mcdaniel, Dissertation Advisor/Co-Advisor, Patrick Drew Mcdaniel, Committee Chair/Co-Chair, Trent Ray Jaeger, Committee Member, Thomas F Laporta, Committee Member, Eileen M Kane, Committee Member.
Subjects/Keywords: operating systems; smartphone; security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Enck, W. H. (2011). Analysis Techniques for Mobile Operating System Security
. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/11817
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Enck, William Harold. “Analysis Techniques for Mobile Operating System Security
.” 2011. Thesis, Penn State University. Accessed January 21, 2021.
https://submit-etda.libraries.psu.edu/catalog/11817.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Enck, William Harold. “Analysis Techniques for Mobile Operating System Security
.” 2011. Web. 21 Jan 2021.
Vancouver:
Enck WH. Analysis Techniques for Mobile Operating System Security
. [Internet] [Thesis]. Penn State University; 2011. [cited 2021 Jan 21].
Available from: https://submit-etda.libraries.psu.edu/catalog/11817.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Enck WH. Analysis Techniques for Mobile Operating System Security
. [Thesis]. Penn State University; 2011. Available from: https://submit-etda.libraries.psu.edu/catalog/11817
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University
5.
Vijayakumar, Hayawardh.
Protecting Programs During Resource Access.
Degree: 2014, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/21412
► With the emergence of targeted malware such as Stuxnet and the continued prevalence of spyware and other types of malicious software, host security has become…
(more)
▼ With the emergence of targeted malware such as Stuxnet and the continued prevalence of spyware and other types of malicious software, host security has become a critical issue. Attackers break into
systems through vulnerabilities in network daemons, malicious insiders, or social engineering, and then attempt to escalate privileges to the administrator to gain complete control of the system by exploiting local vulnerabilities. Thus far, such local vulnerabilities have received little attention, and it has been taken for granted that any attacker break-in can easily be escalated to full control.
In this dissertation, we identify a class of previously disjoint local vulnerability attack classes that we call resource access attacks, and provide a framework to detect and defend against them. Programs have to fetch resources, such as files from the
operating system (OS) to function. However, local adversaries such as spyware also share this namespace of resources, and can trick programs into retrieving an unintended resource using a variety of resource access attacks that make up 10-15% of vulnerabilities reported each year. Such attacks are challenging to defend for a few reasons. First, program checks to defend against such attacks cause a performance overhead, so programmers have an incentive to omit checks altogether. Second, there is a disconnect between the parties involved in resource access. On the one hand, due to this overhead, programmers omit checks under the expectation that the deployment’s access control policy will protect a subset of resources from adversaries. On the other hand, access control policies are framed by OS distributors and system administrators, who in turn have little idea about programmer expectations, causing mismatches with programmer expectations. Third, even when programmers check resource access, such checks are difficult to get right due to inherent races in the system call API. Previous work handles a subset of resource access attacks but in ad-hoc ways.
This dissertation takes several steps to address resource access attacks. First, we present a technique for automated evaluation of a program attack surface in its system deployment, where checks for resource access are required. Second, we present a technique that uses this attack surface to detect a subset of resource access attacks. We found more than 25 previously-unknown vulnerabilities across a variety of both mature and new programs in the widely-used Fedora and Ubuntu Linux distributions, proving the prevalence of such vulnerabilities. Third, we present the Process Firewall, a system to defend against resource access attacks in an efficient manner without requiring program code change. Fourth, we propose a technique to automatically derive the programmer-expected attack surface of a program, and generate Process Firewall rules to enforce that the only adversary-controlled resource accesses in the deployment are part of the expected attack surface. The work in this dissertation thus provides a principled starting point to…
Advisors/Committee Members: Trent Ray Jaeger, Dissertation Advisor/Co-Advisor, Patrick Drew Mcdaniel, Committee Chair/Co-Chair, Bhuvan Urgaonkar, Committee Member, Constantino Manuel Lagoa, Special Member.
Subjects/Keywords: Operating Systems; Security; Resource Access
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vijayakumar, H. (2014). Protecting Programs During Resource Access. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/21412
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Vijayakumar, Hayawardh. “Protecting Programs During Resource Access.” 2014. Thesis, Penn State University. Accessed January 21, 2021.
https://submit-etda.libraries.psu.edu/catalog/21412.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Vijayakumar, Hayawardh. “Protecting Programs During Resource Access.” 2014. Web. 21 Jan 2021.
Vancouver:
Vijayakumar H. Protecting Programs During Resource Access. [Internet] [Thesis]. Penn State University; 2014. [cited 2021 Jan 21].
Available from: https://submit-etda.libraries.psu.edu/catalog/21412.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Vijayakumar H. Protecting Programs During Resource Access. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/21412
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign
6.
Lenharth, Andrew D.
Automatic recovery for request oriented systems.
Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/18421
► Gracefully recovering from software and hardware faults is important to ensuring highly reliable and available systems. Operating systems have privileged access to all aspects of…
(more)
▼ Gracefully recovering from software and hardware faults is important to ensuring
highly reliable and available
systems.
Operating systems have privileged
access to all aspects of system operation, thus a fault related to them
is able to affect the entire system. Existing approaches to
operating system
recovery either do not protect the entire system or require a completely new
operating system design.
This dissertation presents a new approach to fault recovery in
operating
systems called Recovery Domains. This approach allows recovery from
unanticipated faults in commodity
operating systems. Recovery is organized
around the concept of a dynamic request.
Operating system entry points initiate
requests to perform some action. System calls, for example, are a request
by an application to the
operating system. When a fault is detected, the recovery
system rolls back the effects of the offending recovery domain while
leaving the remainder of the system running. To ensure that the entire system
(including the state of other concurrent kernel threads) remains consistent
after the rollback, dependencies between domains are tracked as the system
runs. When rolling back a faulting domain, any other domains that were dependent
on the it, because of dataflow
between the domains, are rolled back
and restarted.
Recovery Domains do not make faults transparent. Request failures are
reported to the requester. This visibility allows handling of faults which are
permanent: those faults which would reoccur if the request were retried. Recovery
Domains also handle timing and transient faults.
Recovery Domains require compiler support to instrument the system.
The necessary support is simple, but can cause unnecessarily large system
overhead. This dissertation describes several performance improvements to
Recovery Domains based on dynamic analysis of the system state and static
analysis of memory regions, allocators, and locks. Runtime analysis of the
interdependence
of the active requests can allow reduced tracking of state
changes. The recovery compiler can reason about memory regions and data
structures protected by a lock to eliminate instrumentation on many operations
to locked memory. ???Fresh??? heap objects, those objects which have been
allocated and have not yet become visible to other requests and threads, require
no instrumentation. These improvements to the recovery runtime and
compiler provide substantial performance improvements over more simple
implementations.
This dissertation describes the goals, approach, semantics, and programming
model of Recovery Domains; the minimal implementation of the runtime
and compiler; the static analysis and optimization at the compiler level
and dynamic optimization to the runtime; and the porting of two significantly
different versions of the Linux kernel to the recovery system. It evaluates
the overhead, effectiveness, and coverage of recovery. Finally it describes
the potential integration of a model fault detector with the Recovery
Domains…
Advisors/Committee Members: Adve, Vikram S. (advisor), Adve, Vikram S. (Committee Chair), Adve, Sarita V. (committee member), King, Samuel T. (committee member), Zhou, Yuanyuan (committee member).
Subjects/Keywords: Recovery; Transactions; Operating Systems; Compilers
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lenharth, A. D. (2011). Automatic recovery for request oriented systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18421
Chicago Manual of Style (16th Edition):
Lenharth, Andrew D. “Automatic recovery for request oriented systems.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 21, 2021.
http://hdl.handle.net/2142/18421.
MLA Handbook (7th Edition):
Lenharth, Andrew D. “Automatic recovery for request oriented systems.” 2011. Web. 21 Jan 2021.
Vancouver:
Lenharth AD. Automatic recovery for request oriented systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/2142/18421.
Council of Science Editors:
Lenharth AD. Automatic recovery for request oriented systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18421
7.
Delaney, Samuel F.
RealPi - A Real Time Operating System on the Raspberry Pi.
Degree: 2018, University of Nevada – Reno
URL: http://hdl.handle.net/11714/4868
► Academia has always sought to ride the line between established thought and new developments. No much more so than in the terms of technology. Universities…
(more)
▼ Academia has always sought to ride the line between established thought and new developments. No much more so than in the terms of technology. Universities seek to teach using a known and proven method and resource but also stay relevant with new technologies to provide students the knowledge they will need to be competitive in the work place or graduate field.This thesis will explore how the University of Nevada Reno approaches this problem with its Real Time
Operating system course. Namely on how using the established Micro cOS II Real time
Operating System with the new builder phenomena the Raspberry Pi we can overcome the challenge of updating a tried and true lesson plan updated to use technology relevant and interesting to the students of today.
Advisors/Committee Members: Egbert, Dwight (advisor), Harris, Frederick C. (committee member), Zhu, Xiaoshan (committee member).
Subjects/Keywords: Operating Systems; Real Time
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Delaney, S. F. (2018). RealPi - A Real Time Operating System on the Raspberry Pi. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/4868
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Delaney, Samuel F. “RealPi - A Real Time Operating System on the Raspberry Pi.” 2018. Thesis, University of Nevada – Reno. Accessed January 21, 2021.
http://hdl.handle.net/11714/4868.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Delaney, Samuel F. “RealPi - A Real Time Operating System on the Raspberry Pi.” 2018. Web. 21 Jan 2021.
Vancouver:
Delaney SF. RealPi - A Real Time Operating System on the Raspberry Pi. [Internet] [Thesis]. University of Nevada – Reno; 2018. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/11714/4868.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Delaney SF. RealPi - A Real Time Operating System on the Raspberry Pi. [Thesis]. University of Nevada – Reno; 2018. Available from: http://hdl.handle.net/11714/4868
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waikato
8.
Hunkin, Paul Wade.
Distributed Operating Systems on Wireless Sensor Networks
.
Degree: 2017, University of Waikato
URL: http://hdl.handle.net/10289/11059
► This thesis proposes the use of traditional distributed operating system and distributed systems techniques that are adapted and applied to the wireless sensor network domain.…
(more)
▼ This thesis proposes the use of traditional distributed
operating system and distributed
systems techniques that are adapted and applied to the wireless sensor network domain. These techniques are applied to the creation of a wireless sensor network
operating system that allows complex applications to be created without special programmer knowledge of sensor network programming or architecture. The resulting system is capable of executing a high level user application written in conventional single-system-image form, without the user being aware of the mesh architecture or underlying sensor node hardware.
A wireless sensor network is a collection of battery-powered embedded
systems that communicate over low-bandwidth radio. Because of their limited hardware, niche deployments and use of embedded processors, programming techniques for wireless sensor network nodes are generally relatively esoteric compared to most software programming tasks. This can be relatively complex for programmers not familiar with the wireless sensor network domain. A naive approach to writing a wireless sensor network application may well result in considerably reduced battery life due to inefficient use of the limited power resources, requiring an expensive and time-consuming replacement or patching process.
As a result of this complexity, traditional wireless sensor network applications are written as simply as possible. The majority of these applications simply move passive data readings back across a mesh to a more powerful server. While this is a sufficiently effective approach in some situations, for other sensor network deployments involving large amounts of complex data it is more efficient for the sensor network application to process at least some of the data inside the mesh, saving on unnecessary data transmissions. However in the real world, the complexity of writing such an application in many cases precludes this from being created. An
operating system that provides power-efficient distributed processing while presenting a more standard unified single system image to the application developer would provide new possibilities for sensor network application developers in terms of creating dynamic and complex sensor network applications.
This thesis covers the design decisions, development process and evaluation of the Hydra distributed wireless sensor network
operating system, an
operating system that provides these services. The system is evaluated in the form of a scenario for monitoring intruders over a large area using accelerometer monitoring – during this scenario, power efficiency is gained due to the intelligent Hydra
operating system services, as the resulting accelerometer data is not moved across potentially multi-hop network links. Application code complexity is also reduced due to the higher-level single system image programming environment.
Advisors/Committee Members: McGregor, Anthony James (advisor), Holmes, Geoffrey (advisor).
Subjects/Keywords: Wireless Sensor Networks;
Operating Systems;
Distributed Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hunkin, P. W. (2017). Distributed Operating Systems on Wireless Sensor Networks
. (Doctoral Dissertation). University of Waikato. Retrieved from http://hdl.handle.net/10289/11059
Chicago Manual of Style (16th Edition):
Hunkin, Paul Wade. “Distributed Operating Systems on Wireless Sensor Networks
.” 2017. Doctoral Dissertation, University of Waikato. Accessed January 21, 2021.
http://hdl.handle.net/10289/11059.
MLA Handbook (7th Edition):
Hunkin, Paul Wade. “Distributed Operating Systems on Wireless Sensor Networks
.” 2017. Web. 21 Jan 2021.
Vancouver:
Hunkin PW. Distributed Operating Systems on Wireless Sensor Networks
. [Internet] [Doctoral dissertation]. University of Waikato; 2017. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10289/11059.
Council of Science Editors:
Hunkin PW. Distributed Operating Systems on Wireless Sensor Networks
. [Doctoral Dissertation]. University of Waikato; 2017. Available from: http://hdl.handle.net/10289/11059
9.
Mehrab, A K M Fazla.
Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques.
Degree: MS, Computer Engineering, 2018, Virginia Tech
URL: http://hdl.handle.net/10919/86485
► Cloud computing providers run data centers which are composed of thousands of server machines. Servers are robust, scalable, and thus capable of executing many jobs…
(more)
▼ Cloud computing providers run data centers which are composed of thousands of server machines. Servers are robust, scalable, and thus capable of executing many jobs efficiently. At the same time, they are expensive to purchase and maintain. However, these servers may become overloaded by the jobs and take more time to finish their execution. In this situation, we propose a system which runs low-cost, low-power single-board computers in the data centers to help the servers, in considered scenarios, reduce execution time by transferring jobs from the server to the boards. Cloud providers run services inside virtual machines (VM) which provides isolation from other services. As these boards are not capable of running traditional VMs due to the low resources, we run lightweight VMs, called unikernel, in them. So if the servers are overloaded, some jobs running inside unikernels are offloaded to the boards. Later when the server gets some of its resources freed, these jobs are migrated back to the server. This back and forth migration system development for a unikernel is composed of several modules. This thesis discuss detail design and implementation of a few of these modules such as unikernel build environment implementation, and unikernel's execution state transfer during the migration.
Advisors/Committee Members: Ravindran, Binoy (committeechair), Min, Changwoo (committee member), Zeng, Haibo (committee member).
Subjects/Keywords: Operating Systems; Unikernels; Virtualization; Heterogeneous Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mehrab, A. K. M. F. (2018). Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86485
Chicago Manual of Style (16th Edition):
Mehrab, A K M Fazla. “Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques.” 2018. Masters Thesis, Virginia Tech. Accessed January 21, 2021.
http://hdl.handle.net/10919/86485.
MLA Handbook (7th Edition):
Mehrab, A K M Fazla. “Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques.” 2018. Web. 21 Jan 2021.
Vancouver:
Mehrab AKMF. Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10919/86485.
Council of Science Editors:
Mehrab AKMF. Cross-ISA Execution Migration of Unikernels: Build Toolchain, Memory Alignment, and VM State Transfer Techniques. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/86485
10.
Thames, Sixten Sjöström.
Porting a Real-Time Operating System to a Multicore Platform.
Degree: The Institute of Technology, 2012, Linköping UniversityLinköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76933
► This thesis is part of the European MANY project. The goal of MANY is to provide developers with tools to develop software for multi…
(more)
▼ This thesis is part of the European MANY project. The goal of MANY is to provide developers with tools to develop software for multi and many-core hardware platforms. This is the first thesis that is part of MANY at Enea. The thesis aims to provide a knowledge base about software on many-core at the Enea student research group. More than just providing a knowledge base, a part of the thesis is also to port Enea's operating system OSE to Tilera's many-core processor TILEpro64. The thesis shall also investigate the memory hierarchy and interconnection network of the Tilera processor.
The knowledge base about software on many-core was constrained to investigating the shared memory model and operating systems for many-core. This was achieved by investigating prominent academic research about operating systems for many-core processors. The conclusion was that a shared memory model does not scale and for the operating system case, operating systems shall be designed with scalability as one of the most important requirements.
This thesis has implemented the hardware abstraction layer required to execute a single-core version of OSE on the TILEpro architecture. This was done in three steps. The Tilera hardware and the OSE software platform were investigated. After that, an OSE target port was chosen as reference architecture. Finally, the hardware dependent parts of the reference software were modified. A foundation has been made for future development.
Subjects/Keywords: operating system; operating systems; many-core; manycore; multicore; RTOS; distributed operating system; Computer Engineering; Datorteknik
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Thames, S. S. (2012). Porting a Real-Time Operating System to a Multicore Platform. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76933
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Thames, Sixten Sjöström. “Porting a Real-Time Operating System to a Multicore Platform.” 2012. Thesis, Linköping UniversityLinköping University. Accessed January 21, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76933.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Thames, Sixten Sjöström. “Porting a Real-Time Operating System to a Multicore Platform.” 2012. Web. 21 Jan 2021.
Vancouver:
Thames SS. Porting a Real-Time Operating System to a Multicore Platform. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2021 Jan 21].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76933.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Thames SS. Porting a Real-Time Operating System to a Multicore Platform. [Thesis]. Linköping UniversityLinköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76933
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Tasmania
11.
Weber, M.
The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security.
Degree: 2011, University of Tasmania
URL: https://eprints.utas.edu.au/12272/2/Mel_Weber_Thesis_2011.pdf
;
https://eprints.utas.edu.au/12272/3/References-thesis-Weber-_2011.pdf
► Interest in accessing, developing and transporting offshore resources in the polar environments comprise elements of energy and environmental security. These contemporary issues place stress on…
(more)
▼ Interest in accessing, developing and transporting offshore resources in the
polar environments comprise elements of energy and environmental security.
These contemporary issues place stress on the systems of polar governance,
expressed in this thesis as operating systems. The capacity of each polar
operating system to deal with emerging issues is determined by operating
system robustness. This thesis argues that robustness of polar governance is
not solely dependent on the structure of the operating system. Robustness is
attained, and maintained, through the dynamic interaction between the actors
and the systems’ components. Robustness is defined through the combination
of participant confidence and the ability to effectively avoid prejudice to
states’ rights. Participant confidence further relies on state authority,
legitimacy and resilience. Robustness is lost if the system is pushed below an
operating system threshold.
Case studies linked to energy and environmental security have been used to
identify characteristics of participant confidence and effectiveness. The case
studies examine the debate concerning the status of the Arctic waterways, the
negotiation and abandonment of the Convention on the Regulation of
Antarctic Mineral Resource Activities, and the continental shelf delimitation
process undergone by the Russian Federation in the Arctic and Australia in
the Antarctic. Polar offshore oil and gas activities, potential and regulation are
also examined. Once compared, the capacity of the operating systems to
accommodate contemporary challenges and future issues which accompany
increased access to the polar environments is examined. Contemporary
challenges include industry-related scientific research, shipping and the
increase, or onset of, offshore oil and gas industry activities.
This analysis reveals both differences and similarities between the Arctic and
Antarctic operating systems. In the Arctic voluntary initiatives and recognized
sovereignty reinforce the ability of state authority to drive participant
confidence and regional norms. Commitment to regional accountability
advances legitimacy and resilience within the system. In the Antarctic every
state committed to the Antarctic Treaty System acts to ensure prejudice of
states’ rights does not occur. Resilience of the system is reinforced by the
significant consequences for abandoning the system. Widely accepted norms
of behavior within the mix of hard and soft law instruments of the Antarctic
operating system contributes to its legitimacy.
This thesis highlights the capacity of the polar operating systems to
accommodate challenges. Each system, though different in structure, has
remained above the operating system threshold. As long as there is acceptance
of the operating system dynamics, sources of law and terms of engagement
related to sovereign rights and regional cooperation, contemporary and
emerging regulatory issues can in turn be overcome.
Subjects/Keywords: polar environments; operating systems; operating
system robustness; Robustness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Weber, M. (2011). The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/12272/2/Mel_Weber_Thesis_2011.pdf ; https://eprints.utas.edu.au/12272/3/References-thesis-Weber-_2011.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Weber, M. “The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security.” 2011. Thesis, University of Tasmania. Accessed January 21, 2021.
https://eprints.utas.edu.au/12272/2/Mel_Weber_Thesis_2011.pdf ; https://eprints.utas.edu.au/12272/3/References-thesis-Weber-_2011.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Weber, M. “The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security.” 2011. Web. 21 Jan 2021.
Vancouver:
Weber M. The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security. [Internet] [Thesis]. University of Tasmania; 2011. [cited 2021 Jan 21].
Available from: https://eprints.utas.edu.au/12272/2/Mel_Weber_Thesis_2011.pdf ; https://eprints.utas.edu.au/12272/3/References-thesis-Weber-_2011.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Weber M. The strength to continue : a case study approach to examining the robustness of polar governance in the era of environmental and energy security. [Thesis]. University of Tasmania; 2011. Available from: https://eprints.utas.edu.au/12272/2/Mel_Weber_Thesis_2011.pdf ; https://eprints.utas.edu.au/12272/3/References-thesis-Weber-_2011.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
12.
Goel, Ashvin.
Operating system support for low-latency streaming.
Degree: PhD, 2003, Oregon Health Sciences University
URL: doi:10.6083/M4CV4FPQ
;
http://digitalcommons.ohsu.edu/etd/291
Subjects/Keywords: Operating systems (Computers)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Goel, A. (2003). Operating system support for low-latency streaming. (Doctoral Dissertation). Oregon Health Sciences University. Retrieved from doi:10.6083/M4CV4FPQ ; http://digitalcommons.ohsu.edu/etd/291
Chicago Manual of Style (16th Edition):
Goel, Ashvin. “Operating system support for low-latency streaming.” 2003. Doctoral Dissertation, Oregon Health Sciences University. Accessed January 21, 2021.
doi:10.6083/M4CV4FPQ ; http://digitalcommons.ohsu.edu/etd/291.
MLA Handbook (7th Edition):
Goel, Ashvin. “Operating system support for low-latency streaming.” 2003. Web. 21 Jan 2021.
Vancouver:
Goel A. Operating system support for low-latency streaming. [Internet] [Doctoral dissertation]. Oregon Health Sciences University; 2003. [cited 2021 Jan 21].
Available from: doi:10.6083/M4CV4FPQ ; http://digitalcommons.ohsu.edu/etd/291.
Council of Science Editors:
Goel A. Operating system support for low-latency streaming. [Doctoral Dissertation]. Oregon Health Sciences University; 2003. Available from: doi:10.6083/M4CV4FPQ ; http://digitalcommons.ohsu.edu/etd/291

University of California – Berkeley
13.
Rhoden, Barret.
Operating System Support for Parallel Processes.
Degree: Computer Science, 2014, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/8gt545mj
► High-performance, parallel programs want uninterrupted access to physical resources. This characterization is true not only for traditional scientific computing, but also for high-priority data center…
(more)
▼ High-performance, parallel programs want uninterrupted access to physical resources. This characterization is true not only for traditional scientific computing, but also for high-priority data center applications that run on parallel processors. These applications require high, predictable performance and low latency, and they are important enough to warrant engineering effort at all levels of the software stack. Given the recent resurgence of interest in parallel computing as well as the increasing importance of data center applications, what changes can we make to operating system abstractions to support parallel programs?Akaros is a research operating system designed for single-node, large-scale SMP and many-core architectures. The primary feature of Akaros is a new process abstraction called the "Many-Core Process" (MCP) that embodies transparency, application control of physical resources, and performance isolation. The MCP is built on the idea of separating cores from threads: the operating system grants spatially partitioned cores to the MCP, and the application schedules its threads on those cores. Data centers typically have a mix of high-priority applications and background batch jobs, where the demands of the high-priority application can change over time. For this reason, an important part of Akaros is the provisioning, allocation, and preemption of resources, and the MCP must be able to handle having a resource revoked at any moment.In this work, I describe the MCP abstraction and the salient details of Akaros. I discuss how the kernel and user-level libraries work together to give an application control over its physical resources and to adapt to the revocation of cores at any time - even when the code is holding locks. I show an order of magnitude less interference for the MCP compared to Linux, more resilience to the loss of cores for an HPC application, and how a customized user-level scheduler can increase the performance of a simple webserver.
Subjects/Keywords: Computer science; Operating Systems; Parallel Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rhoden, B. (2014). Operating System Support for Parallel Processes. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8gt545mj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Rhoden, Barret. “Operating System Support for Parallel Processes.” 2014. Thesis, University of California – Berkeley. Accessed January 21, 2021.
http://www.escholarship.org/uc/item/8gt545mj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Rhoden, Barret. “Operating System Support for Parallel Processes.” 2014. Web. 21 Jan 2021.
Vancouver:
Rhoden B. Operating System Support for Parallel Processes. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2021 Jan 21].
Available from: http://www.escholarship.org/uc/item/8gt545mj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Rhoden B. Operating System Support for Parallel Processes. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/8gt545mj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University
14.
Dumitriu, Victor.
A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors.
Degree: 2015, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A3733
► A number of modern digital processing systems implement complex multi-mode applications with high performance requirements and strict operating constraints; examples include video processing and telecommunication…
(more)
▼ A number of modern digital processing
systems implement complex multi-mode applications with high performance requirements and strict
operating constraints; examples include video processing and telecommunication applications. A number of these
systems use increasingly large FPGAs as the implementation medium, due to reduced development costs. The combination of increases in FPGA capacity and system complexity has lead to a non-linear increase in system implementation effort. If left unchecked, implementation effort for such
systems will reach the point where it becomes a design and development bottleneck. At the same time, the reduction in transistor size used to manufacture these devices can lead to increased device fault rates. To address these two problems, the Multi-mode Adaptive Collaborative Reconfigurable self-Organized System (MACROS) Framework and design methodology is proposed and described in this work. The MACROS Framework other the ability for run-time architecture adaptation by integrating FPGA configuration into regular operation. The MACROS Framework allows for run-time generation of Application-Specific Processors (ASPs) through the deployment, assembly and integration
of pre-built functional units; the framework further allows the relocation of functional units without affecting system functionality. The use of functional units as building blocks allows the system to be implemented on a piece-by-piece basis, which reduces the complexity of mapping, placement and routing tasks; the ability to relocate functional units allows fault mitigation by avoiding faulty regions in a device. The proposed framework has been used to implement multiple video processing
systems which were used as verification and testing instruments. The MACROS framework was found to successfully support run-time architecture adaptation in the form of functional unit deployment and relocation in high performance
systems. For large
systems (more than 100 functional units), the MACROS Framework implementation effort, measured as time cost, was found to be one third that of a traditional (monolithic) system; more importantly, in MACRO
Systems this time cost was found to increase linearly with system complexity (the number of functional units). When considering fault mitigation capabilities, the resource overhead associated with the MACROS Framework was found to be up to 85 % smaller than a traditional Triple Module Redundancy (TMR) solution.
Advisors/Committee Members: Ryerson University (Degree grantor).
Subjects/Keywords: Computer architecture; Operating systems (Computers); System design
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dumitriu, V. (2015). A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A3733
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dumitriu, Victor. “A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors.” 2015. Thesis, Ryerson University. Accessed January 21, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A3733.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dumitriu, Victor. “A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors.” 2015. Web. 21 Jan 2021.
Vancouver:
Dumitriu V. A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors. [Internet] [Thesis]. Ryerson University; 2015. [cited 2021 Jan 21].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A3733.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dumitriu V. A framework and method for the run-time on -chip synthesis of multi-mode self-organized reconfigurable stream processors. [Thesis]. Ryerson University; 2015. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A3733
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester
15.
Park, James.
Managing and exploiting flash-based storage for
data-intensive systems.
Degree: PhD, 2014, University of Rochester
URL: http://hdl.handle.net/1802/28526
► Modern computing has matured into a data-intensive, service-oriented activity, leading to increasing storage and I/O demands. However, current storage systems are built on slow, failure-prone,…
(more)
▼ Modern computing has matured into a data-intensive,
service-oriented activity,
leading to increasing storage and I/O
demands. However, current storage systems
are built on slow,
failure-prone, mechanical disks. These systems already face
limitations of deployment scale, power consumption and performance.
In order to
meet current and future storage needs, systems need to
incorporate new storage
media.
NAND Flash is steadily maturing as
a mass storage device, and Flash-based
storage systems are a
promising solution for the new demands of data-driven computing.
Flash-based storage promises better performance than mechanical
disks.
However, existing system software is ill-suited to properly
manage the performance
characteristics of Flash-based storage. The
combination of inappropriate system
support and Flash
characteristics can lead to the breakdown of service guarantees
like fairness and performance isolation. On the other hand, in
developing
appropriate system support for Flash-based storage, the
opportunity to develop
mechanisms for additional, stronger service
guarantees arises.
This dissertation approaches system support for
Flash-based storage from two
perspectives. First, understanding
and managing Flash performance is necessary
in order to provide
reliable service to applications. In particular, an I/O scheduler
based on Flash-oriented principles can provide better fairness and
efficiency than
traditional I/O schedulers. Second, Flash-based
storage provides unique characteristics
and high performance that
can enable more powerful I/O capabilities that a properly
designed system can provide to users. Flash-based storage can
efficiently support
a new I/O primitive, failure-atomic msync(),
that allows application programmers to
failure-atomically evolve
durable application state in a straightforward
manner.
Subjects/Keywords: Flash, I/O; Operating systems; SSDs; Storage
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Park, J. (2014). Managing and exploiting flash-based storage for
data-intensive systems. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/28526
Chicago Manual of Style (16th Edition):
Park, James. “Managing and exploiting flash-based storage for
data-intensive systems.” 2014. Doctoral Dissertation, University of Rochester. Accessed January 21, 2021.
http://hdl.handle.net/1802/28526.
MLA Handbook (7th Edition):
Park, James. “Managing and exploiting flash-based storage for
data-intensive systems.” 2014. Web. 21 Jan 2021.
Vancouver:
Park J. Managing and exploiting flash-based storage for
data-intensive systems. [Internet] [Doctoral dissertation]. University of Rochester; 2014. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/1802/28526.
Council of Science Editors:
Park J. Managing and exploiting flash-based storage for
data-intensive systems. [Doctoral Dissertation]. University of Rochester; 2014. Available from: http://hdl.handle.net/1802/28526

Oregon State University
16.
Colby, Jonathan Axford.
The FLEX/REFLEX paradigm and its application to computer program systems.
Degree: MS, Computer Science, 1976, Oregon State University
URL: http://hdl.handle.net/1957/43460
► The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program…
(more)
▼ The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program
systems and to advantageously display and structure the general hierarchical characteristics of computer program
systems. Program
systems characterized in the paradigm are described both holistically and mechanistically at each hierarchical level. This, together with an explicit description of and distinction between input quantities and output quantities, permits effective and intuitivly logical management of even large
systems. The problems of program synthesis, modification, testing and validation, debugging, and documentation may be decomposed into "sub-problems" associated with each module in the hierarchical structure. Only problems relevant to the holistic behavior of the module need to be considered. Problems associated with the behavior of the elements of the module are dealt with at the next lower hierarchical level, when the element itself is considered as a module. The paradigm is also shown to be consistent and compatable with top-down structured programming.
Advisors/Committee Members: Cull, Paul (advisor).
Subjects/Keywords: Operating systems (Computers)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Colby, J. A. (1976). The FLEX/REFLEX paradigm and its application to computer program systems. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43460
Chicago Manual of Style (16th Edition):
Colby, Jonathan Axford. “The FLEX/REFLEX paradigm and its application to computer program systems.” 1976. Masters Thesis, Oregon State University. Accessed January 21, 2021.
http://hdl.handle.net/1957/43460.
MLA Handbook (7th Edition):
Colby, Jonathan Axford. “The FLEX/REFLEX paradigm and its application to computer program systems.” 1976. Web. 21 Jan 2021.
Vancouver:
Colby JA. The FLEX/REFLEX paradigm and its application to computer program systems. [Internet] [Masters thesis]. Oregon State University; 1976. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/1957/43460.
Council of Science Editors:
Colby JA. The FLEX/REFLEX paradigm and its application to computer program systems. [Masters Thesis]. Oregon State University; 1976. Available from: http://hdl.handle.net/1957/43460

University of Johannesburg
17.
Anderson, George Georgevich.
Operating system scheduling optimization.
Degree: 2013, University of Johannesburg
URL: http://hdl.handle.net/10210/8430
► D.Phil. (Electrical and Electronic Engineering)
This thesis explores methods for improving, or optimizing, Operating System (OS) scheduling. We first study the problem of tuning an…
(more)
▼ D.Phil. (Electrical and Electronic Engineering)
This thesis explores methods for improving, or optimizing, Operating System (OS) scheduling. We first study the problem of tuning an OS scheduler by setting various parameters, or knobs, made available. This problem has not been addressed extensively in the literature, and has never been solved for the default Linux OS scheduler. We present three methods useful for tuning an Operating System scheduler in order to improve the quality of scheduling leading to better performance for workloads. The first method is based on Response Surface Methodology, the second on the Particle Swarm Optimization (PSO), while the third is based on the Golden Section method. We test our proposed methods using experiments and suitable benchmarks and validate their viability. Results indicate significant gains in execution time for workloads tuned with these methods over execution time for workloads running under schedulers with default, unoptimized tuning parameters. The gains for using RSM-based over default scheduling parameter settings are only limited by the type of workload (how much time it needs to execute); gains of up to 16:48% were obtained, but even more are possible, as described in the thesis. When comparing PSO with Golden Section, PSO produced better scheduling parameter settings, but it took longer to do so, while Golden Section produced slightly worse parameter settings, but much faster. We also study a problem very critical to scheduling on modern Central Processing Units (CPUs). Modern CPUs have multicore designs, which corresponds to having more than one CPU on a single chip. These are known as Chip Multiprocessors (CMPs). The CMP is now the standard type of CPU for many different types of computers, including Personal Computers.
Subjects/Keywords: Operating systems (Computers); Production scheduling; Computer scheduling
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Anderson, G. G. (2013). Operating system scheduling optimization. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/8430
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Anderson, George Georgevich. “Operating system scheduling optimization.” 2013. Thesis, University of Johannesburg. Accessed January 21, 2021.
http://hdl.handle.net/10210/8430.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Anderson, George Georgevich. “Operating system scheduling optimization.” 2013. Web. 21 Jan 2021.
Vancouver:
Anderson GG. Operating system scheduling optimization. [Internet] [Thesis]. University of Johannesburg; 2013. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10210/8430.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Anderson GG. Operating system scheduling optimization. [Thesis]. University of Johannesburg; 2013. Available from: http://hdl.handle.net/10210/8430
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University
18.
Zhang, Zhe.
Adding Coordination to the Management of High-End Storage Systems.
Degree: PhD, Computer Science, 2009, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/4865
► Today’s scientific and commercial applications rely heavily on high-end computing(HEC) facilities, including large scale datacenters, supercomputers, and so forth. In these facilities, the storage subsystems…
(more)
▼ Today’s scientific and commercial applications rely heavily on high-end computing(HEC) facilities, including large scale datacenters, supercomputers, and so forth. In these facilities, the storage subsystems are playing an increasingly important role in the overall computing experience perceived by users. Meanwhile, it is a challenging task to provide high performance and reliability to those high-end storage
systems due to their high I/O demands, large scales, and complex architectures.
We observe that in addition to the well-recognized lack of I/O resources relative to computing demands in an aggregate perspective, one main challenge faced by high-end storage
systems lies in the growing scale and complexity of the entire environment. Individually developed system components or algorithms often behave with isolated local optimizations, and handle concurrent user workloads without considering inter-workload relationships.
The author’s Ph.D. research focuses on three novel instances of bringing adaptive coordination to the management of commercial and scientific high-end storage
systems, at different levels of the HEC storage hierarchy. Firstly, on a single storage server, we present a memory cache allocation mechanism which coordinates multiple concurrent sequential access streams with different request rates. Our work is based on the interesting observation that this problem bears a strong resemblance to situations long studied in the field of supply chain management (SCM), used by used by large vendors and retailers. Furthermore, in a multi-level storage architecture, we address the problem of information distortion in uncoordinated prefetching operations on different storage caches. We develop a simple information sharing mechanism, as well as a transparent hierarchy-aware optimization component named PreFetching-Coordinator (PFC), which monitors both upper- and lower-level caches, and adjusts the aggressiveness of lower-level prefetching. Finally, we improve the data availability in an entire distributed storage system by coordinating it with the HPC job scheduler and remote data sources.
We implemented the proposed techniques in real software environments, including a state-of-the-art
operating system kernel, a widely used job scheduler and a popular parallel file system, as well as verified simulators. Our experimental results collected from real system experiments and simulations show that our proposed techniques can significantly improve system performance and reliability by coordinating among system components and requests.
Advisors/Committee Members: Xiaosong Ma, Committee Chair (advisor), William Stewart , Committee Co-Chair (advisor), Frank Mueller, Committee Member (advisor), Robert Handfield, Committee Member (advisor), Sudharshan Vazhkudai, Committee Member (advisor).
Subjects/Keywords: Data Storage; Supply Chain Management; Operating Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, Z. (2009). Adding Coordination to the Management of High-End Storage Systems. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4865
Chicago Manual of Style (16th Edition):
Zhang, Zhe. “Adding Coordination to the Management of High-End Storage Systems.” 2009. Doctoral Dissertation, North Carolina State University. Accessed January 21, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/4865.
MLA Handbook (7th Edition):
Zhang, Zhe. “Adding Coordination to the Management of High-End Storage Systems.” 2009. Web. 21 Jan 2021.
Vancouver:
Zhang Z. Adding Coordination to the Management of High-End Storage Systems. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2021 Jan 21].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/4865.
Council of Science Editors:
Zhang Z. Adding Coordination to the Management of High-End Storage Systems. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4865

Addis Ababa University
19.
Haymanot, Minalu.
MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
.
Degree: 2013, Addis Ababa University
URL: http://etd.aau.edu.et/dspace/handle/123456789/4475
► Mobile devices being available everywhere and support many functionalities they attract business areas and customers. With this interest different new technologies are implemented to satisfy…
(more)
▼ Mobile devices being available everywhere and support many functionalities they attract
business areas and customers. With this interest different new technologies are implemented
to satisfy user needs. Different
operating system developers are in a strong competition to
hold major market share by providing best features. As the technology moves forward quality
should be tested. Hence standard benchmark to measure basic feature performance of
operating systems is needed. The results found from the benchmark measurement are used to
identify weak and strong points of the
operating system. This thesis work focuses on
designing benchmark that measures performance of mobile
operating systems. The most
common mobile
operating systems are Symbian, Android, Windows Mobile, and Blackberry.
My first task is studying some features of each
operating system. The basic features selected
to study the internal behaviour of
operating systems were power management, memory
management and multitasking. The next task is studying how to design the benchmark. In this
work there are two major points: determining metrics to be measured and studying the
programming environment that was used to develop the benchmark. The benchmark
measured performance of the
operating systems using metrics. The metrics are time of
completion of the work, battery percent used to complete the work, and memory used during
the work. The benchmark was tested on emulator and on actual mobile devices for each
operating system. Using the results of the metrics measured a conclusion is drawn and the
reason for the weak point of the performance of the
operating system is identified. Based on
the benchmark result Android, Symbian, Blackberry and Window Mobile
operating systems
are listed in order of their performance. Mainly the thesis work is used to identify the strong
and weak points of each mobile
operating system. So this work can be a basis foundation for
choosing best suited
operating system for an area of interest and also used for further feature
improvement design of
operating systems.
Advisors/Committee Members: Prof. Dr. Sayed Nouh (advisor).
Subjects/Keywords: Benchmark Application;
Metrics;
Features Performance;
Operating systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Haymanot, M. (2013). MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
. (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/4475
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Haymanot, Minalu. “MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
.” 2013. Thesis, Addis Ababa University. Accessed January 21, 2021.
http://etd.aau.edu.et/dspace/handle/123456789/4475.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Haymanot, Minalu. “MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
.” 2013. Web. 21 Jan 2021.
Vancouver:
Haymanot M. MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
. [Internet] [Thesis]. Addis Ababa University; 2013. [cited 2021 Jan 21].
Available from: http://etd.aau.edu.et/dspace/handle/123456789/4475.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Haymanot M. MOBILE OPERATING SYSTEM FEATURE COMPARISION AND DESINGING BENCHMARK TO EVALUTE THEIR PERFORMANCE
. [Thesis]. Addis Ababa University; 2013. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4475
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Tampere University
20.
Ishkov, Nikita.
A complete guide to Linux process scheduling
.
Degree: 2015, Tampere University
URL: https://trepo.tuni.fi/handle/10024/96864
► The subject of this thesis is process scheduling in wide purpose operating systems. For many years kernel hackers all over the world tried to accomplish…
(more)
▼ The subject of this thesis is process scheduling in wide purpose operating systems. For many years kernel hackers all over the world tried to accomplish the seemingly infeasible task of achieving good interaction on desktop systems and low latencies on heavily loaded server machines. Some progress has been made in this area since the rise of free software, but, in opinion of many, it is still far from perfect. Lots of beginner operating system enthusiasts find the existing solutions too complex to understand and, in light of almost complete lack of documentation along with common hostility of active kernel developers towards rookies, impossible to get hands on.
Anyone who has the courage to wade into the dragon infested layer that is the scheduler, should be aware of the ideas behind current implementations before making any contributions. That is what this thesis is about showing how things work under the hood and how they developed to be like this. Every decision behind each concept in a kernel of an OS has its history and meaning. Here I will guide you through process scheduling mechanisms in currently stable Linux kernel as an object lesson on the matter.
The work starts with an overview of the essentials of process abstraction in Linux, and continues with detailed code-level description of scheduling techniques involved in past and present kernels.
Subjects/Keywords: operating systems;
Linux;
process scheduler;
CFS;
BFS
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ishkov, N. (2015). A complete guide to Linux process scheduling
. (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/96864
Chicago Manual of Style (16th Edition):
Ishkov, Nikita. “A complete guide to Linux process scheduling
.” 2015. Masters Thesis, Tampere University. Accessed January 21, 2021.
https://trepo.tuni.fi/handle/10024/96864.
MLA Handbook (7th Edition):
Ishkov, Nikita. “A complete guide to Linux process scheduling
.” 2015. Web. 21 Jan 2021.
Vancouver:
Ishkov N. A complete guide to Linux process scheduling
. [Internet] [Masters thesis]. Tampere University; 2015. [cited 2021 Jan 21].
Available from: https://trepo.tuni.fi/handle/10024/96864.
Council of Science Editors:
Ishkov N. A complete guide to Linux process scheduling
. [Masters Thesis]. Tampere University; 2015. Available from: https://trepo.tuni.fi/handle/10024/96864

University of Adelaide
21.
Hulse, David, 1971-.
Store architecture in a persistant operating system / David Hulse.
Degree: 1998, University of Adelaide
URL: http://hdl.handle.net/2440/19125
Subjects/Keywords: Operating systems (Computers)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hulse, David, 1. (1998). Store architecture in a persistant operating system / David Hulse. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/19125
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hulse, David, 1971-. “Store architecture in a persistant operating system / David Hulse.” 1998. Thesis, University of Adelaide. Accessed January 21, 2021.
http://hdl.handle.net/2440/19125.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hulse, David, 1971-. “Store architecture in a persistant operating system / David Hulse.” 1998. Web. 21 Jan 2021.
Vancouver:
Hulse, David 1. Store architecture in a persistant operating system / David Hulse. [Internet] [Thesis]. University of Adelaide; 1998. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/2440/19125.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hulse, David 1. Store architecture in a persistant operating system / David Hulse. [Thesis]. University of Adelaide; 1998. Available from: http://hdl.handle.net/2440/19125
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Chicago
22.
Merrifield, Timothy M.
Towards High Performance Determinism for Multithreaded Programs.
Degree: 2018, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/22695
► The emergence of multi-core commodity processors, and more recently accelerators, has brought about a resurgence of interest in parallel programming. With that renewed interest comes…
(more)
▼ The emergence of multi-core commodity processors, and more recently accelerators, has brought about a resurgence of interest in parallel programming. With that renewed interest comes a concern amongst practitioners and researchers that traditional models of parallel programming come at the cost of significantly increased complexity. Part of this complexity comes from nondeterminism and its impact on program testing, debugging and overall reasoning. To combat this, deterministic multithreading
systems have been introduced at both the hardware and software layers to enhance repeatability of a computation.
Despite initial research on determinism, the
systems that enforce this property still show significant performance degradation. In this thesis, we describe several approaches to tackling these performance pathologies.
We start by attacking the performance overhead caused by enforcing a deterministic memory model, by using a kernel-level multi-version concurrency control system for main memory segments. We next introduce a new deterministic threading library to make better use of the new memory model. And our final system uses speculation to attack the total order bottleneck in all prior deterministic
systems.
Advisors/Committee Members: Eriksson, Jakob (advisor), Sistla, A. Prasad (committee member), Kshemkalyani, Ajay D (committee member), Devietti, Joseph (committee member), Lev, Yossi (committee member), Eriksson, Jakob (chair).
Subjects/Keywords: determinism; multithreading; operating systems; memory models
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Merrifield, T. M. (2018). Towards High Performance Determinism for Multithreaded Programs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22695
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Merrifield, Timothy M. “Towards High Performance Determinism for Multithreaded Programs.” 2018. Thesis, University of Illinois – Chicago. Accessed January 21, 2021.
http://hdl.handle.net/10027/22695.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Merrifield, Timothy M. “Towards High Performance Determinism for Multithreaded Programs.” 2018. Web. 21 Jan 2021.
Vancouver:
Merrifield TM. Towards High Performance Determinism for Multithreaded Programs. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10027/22695.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Merrifield TM. Towards High Performance Determinism for Multithreaded Programs. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22695
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
23.
Duarte, Diogo Eduardo Rosas.
Comparison of embedded Linux development tools
.
Degree: 2019, Universidade de Aveiro
URL: http://hdl.handle.net/10773/29463
► The increasing interest to connect small sensors to the internet took the development of operating systems able to operate in any hardware ensuring all network,…
(more)
▼ The increasing interest to connect small sensors to the internet took the development
of
operating systems able to operate in any hardware ensuring all network,
graphical and server functionalities. Globaltronic, a company in Águeda, has developed
a hardware platform call WiiPiiDo, that can be described as a embedded
computer, power by an ARM SoC, highly specialized for IoT, ensuring connection
to the Internet even in harsh conditions using NB-IoT- LTE Cat NB1 (Narrow
Band IoT), does ensuring rapid development of complete IoT solutions for endusers.
The development of a Linux image that exposes all the potential of the
hardware platform is a must and will provide extra value to it. In this context, we
take a look at the Yocto Project, which is a building environment that allows the
creation of such a
operating system, and that is gaining a crescent community of
users and specially enterprises. Nevertheless, Yocto is not the only choice for the
developer community for embedded platforms, in fact, a distribution like Armbian,
a Debian/Ubuntu based Distribution that is specialized for ARM boards, appears
as a popular alternative for embedded development in ARM development boards.
In this work we will see the steps necessary to test the first boot of the hardware
platform until the development of the supporting
operating system, passing
through the driver development and performance tests. In the end, the used build
system will be compared, from the results of the tests performance, to the build
system in itself.
Advisors/Committee Members: Rodrigues, João Manuel de Oliveira e Silva (advisor), Silva, Sérgio Paulo Santos (advisor).
Subjects/Keywords: Embedded linux;
Operating systems;
Armbian;
Yocto
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Duarte, D. E. R. (2019). Comparison of embedded Linux development tools
. (Thesis). Universidade de Aveiro. Retrieved from http://hdl.handle.net/10773/29463
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Duarte, Diogo Eduardo Rosas. “Comparison of embedded Linux development tools
.” 2019. Thesis, Universidade de Aveiro. Accessed January 21, 2021.
http://hdl.handle.net/10773/29463.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Duarte, Diogo Eduardo Rosas. “Comparison of embedded Linux development tools
.” 2019. Web. 21 Jan 2021.
Vancouver:
Duarte DER. Comparison of embedded Linux development tools
. [Internet] [Thesis]. Universidade de Aveiro; 2019. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10773/29463.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Duarte DER. Comparison of embedded Linux development tools
. [Thesis]. Universidade de Aveiro; 2019. Available from: http://hdl.handle.net/10773/29463
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto
24.
Soares, Livio.
Operating System Techniques for Reducing Processor State Pollution.
Degree: 2012, University of Toronto
URL: http://hdl.handle.net/1807/32895
► Application performance on modern processors has become increasingly dictated by the use of on-chip structures, such as caches and look-aside buffers. The hierarchical (multi-leveled) design…
(more)
▼ Application performance on modern processors has become increasingly dictated by the use of on-chip structures, such as caches and look-aside buffers. The hierarchical (multi-leveled) design of processor structures, the ubiquity of multicore processor architectures, as well as the increasing
relative cost of accessing memory have all contributed to this condition. Our thesis is that operating systems should provide services and mechanisms for applications to more efficiently utilize on-chip processor structures. As such, this dissertation demonstrates how the operating system can
improve processor efficiency of applications through specific techniques.
Two operating system services are investigated: (1) improving secondary and last-level cache utilization through a run-time cache filtering technique, and (2) improving the processor efficiency of system intensive applications through a new exception-less system call mechanism. With the first mechanism, we introduce the concept of a software pollute buffer and show that it can be used effectively at run-time, with assistance from commodity hardware performance counters, to reduce pollution of secondary on-chip caches.
In the second mechanism, we are able to decouple application and operating system execution, showing the benefits of the reduced interference in various processor components such as the first level instruction and data caches, second level caches and branch predictor. We show that exception-less system calls are particularly effective on modern multicore processors. We explore two ways for applications to use exception-less system calls. The first way, which is completely transparent to the application, uses multi-threading to hide asynchronous communication between the operating system kernel and the application. In the second way, we propose that applications can directly use the exception-less system call interface by designing programs that follow an event-driven architecture.
PhD
Advisors/Committee Members: Stumm, Michael, Electrical and Computer Engineering.
Subjects/Keywords: Operating Systems; Processors; Processor Caches; Multicore; 0984
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Soares, L. (2012). Operating System Techniques for Reducing Processor State Pollution. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/32895
Chicago Manual of Style (16th Edition):
Soares, Livio. “Operating System Techniques for Reducing Processor State Pollution.” 2012. Doctoral Dissertation, University of Toronto. Accessed January 21, 2021.
http://hdl.handle.net/1807/32895.
MLA Handbook (7th Edition):
Soares, Livio. “Operating System Techniques for Reducing Processor State Pollution.” 2012. Web. 21 Jan 2021.
Vancouver:
Soares L. Operating System Techniques for Reducing Processor State Pollution. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/1807/32895.
Council of Science Editors:
Soares L. Operating System Techniques for Reducing Processor State Pollution. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/32895

University of Hong Kong
25.
Yu, Wing-ka.
Execution objects:
flexible composition and efficient interaction.
Degree: 1996, University of Hong Kong
URL: http://hdl.handle.net/10722/39401
Subjects/Keywords: Operating systems (Computers)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, W. (1996). Execution objects:
flexible composition and efficient interaction. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/39401
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yu, Wing-ka. “Execution objects:
flexible composition and efficient interaction.” 1996. Thesis, University of Hong Kong. Accessed January 21, 2021.
http://hdl.handle.net/10722/39401.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yu, Wing-ka. “Execution objects:
flexible composition and efficient interaction.” 1996. Web. 21 Jan 2021.
Vancouver:
Yu W. Execution objects:
flexible composition and efficient interaction. [Internet] [Thesis]. University of Hong Kong; 1996. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/10722/39401.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yu W. Execution objects:
flexible composition and efficient interaction. [Thesis]. University of Hong Kong; 1996. Available from: http://hdl.handle.net/10722/39401
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University
26.
Hom, Jerry Yin.
An execution context optimization framework for disk energy.
Degree: PhD, Computer Science, 2008, Rutgers University
URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17327
► Power, energy, and thermal concerns have had explosive growth in research over the past two decades. In servers, desktops, and mobile systems, the hard disk…
(more)
▼ Power, energy, and thermal concerns have had explosive growth in research over the past two decades. In servers, desktops, and mobile
systems, the hard disk is among the top resources in power and energy consumption. Common techniques for reducing disk energy consumption have included caching, adaptive low power modes, batch scheduling, and data migration. Many previous software optimizations for single disk systems have assumed and experimented in uniprogramming environments.
However, modern systems are typically multiprogramming, and the optimizations do not extend well from the uniprogramming model.
Programs should be aware of concurrently running programs to enable cooperation and coordinate disk accesses from multiple programs. The set of concurrently running programs is referred to as an execution context. Execution context optimizations were introduced to target multiprogramming environments. My research introduces an optimization framework to provide execution context information and reduce disk energy consumption by effectively managing disk accesses.
Optimizing over all possible execution contexts is counter-productive because many contexts do not occur in practice. For an extreme example, users rarely, if at all, run more than twenty programs concurrently. Optimizations may be profitably targeted at the most common execution contexts for a given workload. A study was conducted of real workloads by collecting user activity traces and characterizing the execution contexts. Out of hundreds of contexts
and over 50 unique programs, the study confirmed the intuition that users generally run only a small set of programs at a time.
Execution context optimizations were implemented on eight streaming and interactive applications. The optimizations were compared to previous best optimizations and evaluated on a laptop disk which is already designed for energy efficiency. The disk energy was measured while running synthetic traces of ten execution contexts. The results show up to 63% energy savings while incurring less than 1%
performance delay. When compared to unoptimized versions, energy savings was up to 77%. If the optimizations were applied to
comparable applications in the user study, an estimated 9% disk energy could have been saved. Execution context optimizations show
significant promise for saving disk energy.
Advisors/Committee Members: Hom, Jerry Yin (author), Kremer, Ulrich (chair), Bianchini, Ricardo (internal member), Martin, Rich (internal member), Bellosa, Frank (outside member).
Subjects/Keywords: Operating systems (Computer)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hom, J. Y. (2008). An execution context optimization framework for disk energy. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17327
Chicago Manual of Style (16th Edition):
Hom, Jerry Yin. “An execution context optimization framework for disk energy.” 2008. Doctoral Dissertation, Rutgers University. Accessed January 21, 2021.
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17327.
MLA Handbook (7th Edition):
Hom, Jerry Yin. “An execution context optimization framework for disk energy.” 2008. Web. 21 Jan 2021.
Vancouver:
Hom JY. An execution context optimization framework for disk energy. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2021 Jan 21].
Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17327.
Council of Science Editors:
Hom JY. An execution context optimization framework for disk energy. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17327

University of Rochester
27.
Chen, Zhuan.
System support for data-intensive sensing in the
field.
Degree: PhD, 2016, University of Rochester
URL: http://hdl.handle.net/1802/31468
► High-intensity data sensing and processing in the field are important for emerging applications in intelligent transportation, surveillance, and environmental management. Many such systems reside in…
(more)
▼ High-intensity data sensing and processing in the
field are important for emerging applications
in intelligent
transportation, surveillance, and environmental management.
Many
such systems reside in the field or mobile platforms away from the
wired infrastructure
and face unique challenges such as
application / system management under
unique field conditions,
resource constraint due to the lack of full-power computers and
high-speed network access, and the privacy concern of sensitive
data exposure.
In this dissertation, we study several system-level
approaches to support the emerging
data-intensive sensing systems
in the field. Specifically, we advocate the use of
virtualization
and virtual data management to tackle the unique field conditions
with
the advantages of easy deployment, flexible control, and data
containment. We further
explore efficient data deduplication
mechanisms with the optimized fingerprint management
under field
sensing workloads and the support of efficient, failure-consistent
I/O deduplication on Flash. Finally, we propose a new privacy
protection approach
for continuous data sensing systems with the
guarantee of purging sensitive data and
derived information over a
certain age.
Subjects/Keywords: Cyber-physical systems; Deduplication; Operating systems; Security; Storage systems; Virtualization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, Z. (2016). System support for data-intensive sensing in the
field. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31468
Chicago Manual of Style (16th Edition):
Chen, Zhuan. “System support for data-intensive sensing in the
field.” 2016. Doctoral Dissertation, University of Rochester. Accessed January 21, 2021.
http://hdl.handle.net/1802/31468.
MLA Handbook (7th Edition):
Chen, Zhuan. “System support for data-intensive sensing in the
field.” 2016. Web. 21 Jan 2021.
Vancouver:
Chen Z. System support for data-intensive sensing in the
field. [Internet] [Doctoral dissertation]. University of Rochester; 2016. [cited 2021 Jan 21].
Available from: http://hdl.handle.net/1802/31468.
Council of Science Editors:
Chen Z. System support for data-intensive sensing in the
field. [Doctoral Dissertation]. University of Rochester; 2016. Available from: http://hdl.handle.net/1802/31468

RMIT University
28.
Shelton, A.
Shards: a system for systems.
Degree: 2013, RMIT University
URL: http://researchbank.rmit.edu.au/view/rmit:160899
► Operating system construction is often focused on the internal operation and architecture of a general purpose system. This thesis instead focuses on systems built in…
(more)
▼ Operating system construction is often focused on the internal operation and architecture of a general purpose system. This thesis instead focuses on systems built in response to a specific purpose, design intent, application load and platform. These are referred to as custom systems in the thesis. These focused systems have known demands, constraints and requirements that provide a target for system design and optimisation. These systems can perform valuable and demanding tasks which may encourage optimisation effort. The first challenge is discovering and capturing these attributes in an encoding that can be machine manipulated. The second challenge was to use this information in a way which makes custom system construction economical, thereby widening the range of systems for which such efforts are appropriate. A bespoke and manual system construction is too expensive for the more narrowly deployed systems being considered. The operating systems field generally assumes a long lived and widely deployed general system which can afford significant design effort up-front which is not applicable in this case. The proposed solution was to balance the advantages of modular functionality with automated configuration, construction and tailoring based on the captured demands of the proposed system. Effectively the operating system is compiled as an integrated part of the system. In such an approach new inputs not relevant to general systems, such as application code and design intent, are known in advance and can inform the system generation process. This leads to an operating system structure that is determined by and optimised to the needs of the proposed system. A clean architecture is often a design goal for system construction. In this case the ideal is an operating system so integrated into the overall system there is no clearly identifiable run time structure. The Operating System could become part of the hardware, system operation or applications of the system. The final goal was to build a foundation in which construction work or advances can be captured and reused. Building a complete "system of systems" in a single project would be an impractical undertaking. The effort was to build an approach and framework which could grow as a side effect of its use and application. This allowed the lessons learnt and work done in one project to potentially enrich both this approach and the domain of operating systems.
Subjects/Keywords: Fields of Research; Operating Systems; Operating System Design; operating system optimisation; Automated System Construction; System construction; Custom Systems; Optimised Systems; Task optimised systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shelton, A. (2013). Shards: a system for systems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160899
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Shelton, A. “Shards: a system for systems.” 2013. Thesis, RMIT University. Accessed January 21, 2021.
http://researchbank.rmit.edu.au/view/rmit:160899.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Shelton, A. “Shards: a system for systems.” 2013. Web. 21 Jan 2021.
Vancouver:
Shelton A. Shards: a system for systems. [Internet] [Thesis]. RMIT University; 2013. [cited 2021 Jan 21].
Available from: http://researchbank.rmit.edu.au/view/rmit:160899.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Shelton A. Shards: a system for systems. [Thesis]. RMIT University; 2013. Available from: http://researchbank.rmit.edu.au/view/rmit:160899
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University
29.
Chun, Pil Woo (Peter).
Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture.
Degree: 2009, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A6729
► Despite the success that programmable devices have enjoyed in the last two decades, architecture synthesis methodologies for Run-Time Reconfigurable (RTR) systems are still in their…
(more)
▼ Despite the success that programmable devices have enjoyed in the last two decades, architecture synthesis methodologies for Run-Time Reconfigurable (RTR)
systems are still in their infancy. As the majority of consumer devices integrate multiple-functionality, the cost-effectiveness becomes the main focus of computing
systems design. This thesis presents a novel architecture synthesis methodology for the cost-effective implementation of a multi-task and multi-mode workload. The proposed methodology creates a RTR system that changes its functionality in response to a dynamic environment and enables on-chip assembly of pre-constructed components by synthesizing a workload-specific static architecture. The proposed methodology presents novelties in design abstraction, partitioning method and in the procedure of deciding reconfiguration granularity. The experimental results show the cost benefits of the proposed architecture synthesis methodology saving 73% of area and 29.8% of power compared to fixed design approach
Advisors/Committee Members: Kirischian, Lev (Degree supervisor).
Subjects/Keywords: Adaptive computing systems.; Computer architecture.; Operating systems (Computers); System design
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chun, P. W. (. (2009). Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A6729
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chun, Pil Woo (Peter). “Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture.” 2009. Thesis, Ryerson University. Accessed January 21, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A6729.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chun, Pil Woo (Peter). “Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture.” 2009. Web. 21 Jan 2021.
Vancouver:
Chun PW(. Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture. [Internet] [Thesis]. Ryerson University; 2009. [cited 2021 Jan 21].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6729.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chun PW(. Architecture synthesis methodology of run-time reconfigurable multi-task and multi-mode systems with self-assembling micro-architecture. [Thesis]. Ryerson University; 2009. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6729
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University
30.
Kulkarni, Amit Vasant.
Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching.
Degree: MS, Computer Science, 2009, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/1569
► File system prefetching has been widely studied and used to hide high latency of disk I/O. However, there are very few algorithms that explicitly take…
(more)
▼ File system prefetching has been widely studied and used to hide high latency of disk I/O. However, there are very few algorithms that explicitly take the file access rate or burstiness into account to distribute resources, especially the prefetching memory. In this work we draw parallels between file system prefetching and the field of Supply Chain Management (SCM), particularly Inventory Theory. We further describe two very commonly used algorithms in SCM that directly address access rate and uncertainty. We also implement these prefetching algorithms in the Linux kernel and present the performance results of using these algorithms. Our results show that with these SCM-based algorithms, we can improve the throughput of standard Linux file transfer applications by up to 33% and the throughput of some server workloads (such as Video-on-Demand) by up to 41%.
Advisors/Committee Members: Dr. Xiaosong Ma, Committee Chair (advisor), Dr. Vincent W. Freeh, Committee Member (advisor), Dr. Edward W. Davis, Committee Member (advisor).
Subjects/Keywords: caching; file systems; operating systems; linux; scm; supply chain management;
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kulkarni, A. V. (2009). Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1569
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kulkarni, Amit Vasant. “Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching.” 2009. Thesis, North Carolina State University. Accessed January 21, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/1569.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kulkarni, Amit Vasant. “Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching.” 2009. Web. 21 Jan 2021.
Vancouver:
Kulkarni AV. Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2021 Jan 21].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/1569.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kulkarni AV. Implementing and Evaluating SCM Algorithms for Rate-Aware Prefetching. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1569
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [24] ▶
.