Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Masaki Murakami

dblp:03/6594 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
1since 2021 · last 2024
0000-0002-2188-6125ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 3 first-authorTheory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 56% Distributed systems · 44%
Computer networks
1 paper
Optical networks · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource allocation
hardware resource assignment
0.812024
Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware · IEEE/ACM Trans. Netw. 2024
Distributed systems › distributed scheduling
task reallocation
0.812024
Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware · IEEE/ACM Trans. Netw. 2024
Cloud and datacenter computing
resource management
0.212024
Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware · IEEE/ACM Trans. Netw. 2024

Methods — techniques the papers use, named apart from their topics

simulation · 1.5preemptive resource reallocation · 1.5
YearPublicationVenuePosition
2024 Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware
abstract
This paper proposes a priority-aware guaranteed hardware resource allocation in virtual packet optical nodes (VPONs) and describes experimental evidence of service provisioning with the proposed method on testbed. A network based on the VPON brings solution of service diversification and traffic explosion because it provides multiple services by hardware level separated virtual networks such as IP/Ethernet/ Multi-Protocol Label Switching. The VPON has reconfigurable hardware which is dedicatedly allocated for each service and service-specific logical functions are implemented respectively. However, a previous hardware resource allocation method is not efficient. In previous work, the hardware resources once allocated to a service are not reallocated until the service terminated whenever the hardware is not optimally used. In recent years, hardware reconfiguration time has become shorter and it has enabled to apply for service demand change by releasing hardware from services with low demand and reallocating it to other services with high demand. Thus, this paper proposes preemptive dynamic hardware resource reallocation algorithm for VPON and a priority-aware guaranteed hardware resource reallocation method to realize efficient resource usage and high service capacity. Results of the computer simulation show improving service capability. Furthermore, to demonstrate the feasibility of service provisioning with the proposed method, emulators of the virtual packet optical node were constructed and performed resource reallocation. Results of the experiment show that the virtual packet optical node can configure function chains for providing services based on calculation results of the proposed resource reallocation method.
Masaki Murakami, Takashi Kurimoto, Satoru Okamoto, Naoaki Yamanaka
IEEE/ACM Trans. Netw.1
2013 Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System
abstract
This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.
Masaki Murakami
TASE1
2008 Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
Masaki Murakami
ICTAC1
2006 A formal model of concurrent systems based on bipartite directed acyclic graph
Masaki Murakami
Sci. Comput. Program.1
2005 A calculus for concurrent system with higher-order streaming communication
Masaki Murakami
Sci. Comput. Program.1
2004 A model of runtime transformation for distributed systems based on directed acyclic graph model
Masaki Murakami
J. Syst. Archit.1
1990 A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes
Masaki Murakami
Theor. Comput. Sci.1