MIT Itemshttp://dspace.mediu.edu.my:8181/xmlui/handle/123456789/63652024-03-28T15:02:27Z2024-03-28T15:02:27ZMemory Hierarchy Hardware-Software Co-design in Embedded Systemshttp://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/74272013-10-09T02:49:29Z2013-10-09T00:00:00ZMemory Hierarchy Hardware-Software Co-design in Embedded Systems
The memory hierarchy is the main bottleneck in modern computer systems as the gap between the speed of the processor and the memory continues to grow larger. The situation in embedded systems is even worse. The memory hierarchy consumes a large amount of chip area and energy, which are precious resources in embedded systems. Moreover, embedded systems have multiple design objectives such as performance, energy consumption, and area, etc.
Customizing the memory hierarchy for specific applications is a very important way to take full advantage of limited resources to maximize the performance. However, the traditional custom memory hierarchy design methodologies are phase-ordered. They separate the application optimization from the memory hierarchy architecture design, which tend to result in local-optimal solutions. In traditional Hardware-Software co-design methodologies, much of the work has focused on utilizing reconfigurable logic to partition the computation. However, utilizing reconfigurable logic to perform the memory hierarchy design is seldom addressed.
In this paper, we propose a new framework for designing memory hierarchy for embedded systems. The framework will take advantage of the flexible reconfigurable logic to customize the memory hierarchy for specific applications. It combines the application optimization and memory hierarchy design together to obtain a global-optimal solution. Using the framework, we performed a case study to design a new software-controlled instruction memory that showed promising potential.; Singapore-MIT Alliance (SMA)
2013-10-09T00:00:00ZMatching Interest Points Using Projective Invariant Concentric Circleshttp://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/74262013-10-09T02:49:29Z2013-10-09T00:00:00ZMatching Interest Points Using Projective Invariant Concentric Circles
We present a new method to perform reliable matching between different images. This method exploits a projective invariant property between concentric circles and the corresponding projected ellipses to find complete region correspondences centered on interest points. The method matches interest points allowing for a full perspective transformation and exploiting all the available luminance information in the regions. Experiments have been conducted on many different data sets to compare our approach to SIFT local descriptors. The results show the new method offers increased robustness to partial visibility, object rotation in depth, and viewpoint angle change.; Singapore-MIT Alliance (SMA)
2013-10-09T00:00:00ZReasoning about Temporal Context using Ontology and Abductive Constraint Logic Programminghttp://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/74362013-10-09T02:49:29Z2013-10-09T00:00:00ZReasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming
The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.; Singapore-MIT Alliance (SMA)
2013-10-09T00:00:00ZLower Bounds for Achieving Synchronous Early Stopping Consensus with Orderly Crash Failureshttp://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/74252013-10-09T02:49:29Z2013-10-09T00:00:00ZLower Bounds for Achieving Synchronous Early Stopping Consensus with Orderly Crash Failures
In this paper, we discuss the consensus problem for synchronous distributed systems with orderly crash failures. For a synchronous distributed system of n processes with up to t crash failures and f failures actually occur, first, we present a bivalency argument proof to solve the open problem of proving the lower bound, min (t + 1, f + 2) rounds, for early-stopping synchronous consensus with orderly crash failures, where t < n - 1. Then, we extend the system model with orderly crash failures to a new model in which a process is allowed to send multiple messages to the same destination process in a round and the failing processes still respect the order specified by the protocol in sending messages. For this new model, we present a uniform consensus protocol, in which all non-faulty processes always decide and stop immediately by the end of f + 1 rounds. We prove that the lower bound of early stopping protocols for both consensus and uniform consensus are f + 1 rounds under the new model, and our proposed protocol is optimal.; Singapore-MIT Alliance (SMA)
2013-10-09T00:00:00Z