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

Y. E. Chen

dblp:18/1579 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Memory systems · 67% Parallel and multicore computing · 33%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory hierarchy
0.011972
Memory Requirements in a Multiprocessing Environment · J. ACM 1972
Parallel and multicore computing
multiprocessor system
0.011972
Memory Requirements in a Multiprocessing Environment · J. ACM 1972
Memory systems › memory hierarchy
two-level memory system
0.011972
Memory Requirements in a Multiprocessing Environment · J. ACM 1972

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

computation graph · 0.0
YearPublicationVenuePosition
2008 Supporting vertical handover between universal mobile telecommunications system and wireless LAN for real-time services
abstract
The provisioning of the seamless handovers for real-time services in-between UMTS/WLAN loose-interworking by the network-layer technologies has been studied. Issues are how to execute such a vertical handover in a fast and efficient manner as well as how to achieve it in a viable way. To resolve such issues, a novel scheme called ‘designated crossover point’ (DCP) within the existing IP end-to-end Quality of Servce (QoS) architecture has been proposed. The DCP is an agent at the edge router in the customer's premise to join the old RSVP signalling path and new RSVP signalling path. With the DCP in place, the vertical handover can be greatly accelerated. Besides, by enabling the DCP to handover to the edge router in the customer's network currently visited by the mobile, lower charging cost can be achieved. Finally, there is no modification required for the devices in the provider's network and thus the viability is much improved. It is then end up with a topology for resource management in IP backbone for UMTS/WLAN loose-interworking to support the idea of DCP. To determine when to perform the rerouting to remove the possible derouting caused by DCPs, use of an adaptive rule has been suggested. Simulation results show in general that the adaptive rule is effective.
W.-K. Liao, Y. E. Chen
IET Commun.2
1972 Memory Requirements in a Multiprocessing Environment
abstract
Main memory and intermemory data transmission rate requirements of two-level memory multiprocessor systems are characterized.Operational software is modeled by computation graphs.For a fixed processing schedule, independent bounds on the main memory M and the data transmission rate C, required to insure that the processing will follow the specified schedule, are determined.Tradeoffs between M and C are completely specified by determination of the family of (M, C) pairs, any member of which will guarantee that the fixed schedule will be followed.The notion of an optimal pair (M, C) is introduced and the optimal pairs are also found.The interrelationship between values of (M, C) pairs and schedules is briefly explored througb modification of specified schedules.
Y. E. Chen, Donald L. Epley
J. ACM1