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

Armin Jahanpanah

dblp:35/6458 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 2

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 networks
1 paper
Software-defined and programmable networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
network function virtualization
0.112012
Enabling dynamic network processing with clickOS · SIGCOMM 2012
Cloud and datacenter computing › virtualization › network virtualization
virtual network functions
0.012012
Enabling dynamic network processing with clickOS · SIGCOMM 2012
YearPublicationVenuePosition
2013 Experiences with large-scale operational trials of ALTO-enhanced P2P filesharing in an intra-ISP scenario
Mischa Schmidt, Jan Seedorf, Stefano Napolitano, Rosario Giuseppe Garroppo, Andrea Cavaliere, Thilo Ewald, Armin Jahanpanah, Zbigniew Kopertowski, Marcin Pilarski, Pawel Grochocki
Peer-to-Peer Netw. Appl.7
2012 Enabling dynamic network processing with clickOS
abstract
No abstract available.
Mohamed Ahmed 0001, Felipe Huici, Armin Jahanpanah
SIGCOMM3
2008 User-Land Work Stealing Schedulers: Towards a Standard
abstract
Multicore processors are currently hitting the market at enormous speed. Multi-processing in all its variants is seen as the way into the future of computational systems and imply parallelism for future applications. The basics of software development are changing when going parallel. One key concept to ensure scalability of today's applications for the future is the idea of using work stealing scheduling systems to ensure load balancing, and re-writing existing software is necessary to exploit that style of programming. The numerous work stealing concepts however differ in form of implementation, interfaces and supported systems. Handling this diversity of systems makes the already complicated process of going parallel even worse. We present a simple but complete work stealing scheduler (TPI - Task Processing Interface) as an example and formulate the requirements to a basic work stealing interface as a first step to an open standard proposal.
Jörg Wagner 0003, Armin Jahanpanah, Jesper Larsson Träff
CISIS2