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

Vipul Shingde

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

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

Applied, 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
Embedded and real-time systems · 100%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 100%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
cyber-physical system platforms
0.112008
Merge-by-Wire: Algorithms and System Support · RTSS 2008
Embedded and real-time systems
real-time scheduling
0.112008
Merge-by-Wire: Algorithms and System Support · RTSS 2008
Embedded and real-time systems
timing constraints
0.112008
Merge-by-Wire: Algorithms and System Support · RTSS 2008
Vehicular, aerial and satellite networks › vehicular ad hoc networks
DSRC
0.012008
Merge-by-Wire: Algorithms and System Support · RTSS 2008
Vehicular, aerial and satellite networks
vehicular networks
0.012008
Merge-by-Wire: Algorithms and System Support · RTSS 2008

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

simulation · 0.2
YearPublicationVenuePosition
2008 Merge-by-Wire: Algorithms and System Support
abstract
Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement ldquoby-wirerdquo applications for taking smart decisions on the road or assisting the driver in doing the same. Given this proliferation, there is a need to minimize the computing power required without affecting the performance and safety of the applications. The latter is especially important since these by-wire applications are distributed and real-time in nature and involve deadline bound computations on critical data gathered from the environment. These applications have stringent requirements on the freshness of data items and completion time of the tasks. Our work studies one such safety-related automotive application namely, automatic merge control (AMC) which ensures safe vehicle maneuver in the region where two or more roads intersect.As our contributions, we (i) propose two merge algorithms for amc: head of the lane (HoL) and all feasible sequences (AFS) (ii) demonstrate how DSRC-based wireless communication protocol can be leveraged for the development of AMC (iii) present a real-time approach towards designing AMC by integrating mode-change and real-time repository concepts for reducing the processing power requirements and (iv) provide a scheduling strategy to meet AMC taskspsila timing requirements. Simulations and implementation on robotic vehicular platforms demonstrate the advantages of using our approach for constructing merge-by-wire systems.
Vipul Shingde, Gurulingesh Raravi, Ashish Gudhe, Prakhar Goyal, Krithi Ramamritham
RTSS1