SwePub
Sök i SwePub databas

  form:Ext_t

Träfflista för sökning "swepub ;pers:(Jantsch Axel)"

form:Search_simp_t: swepub > Jantsch Axel

  • navigation:Result_t 1-10 navigation:of_t 356
hitlist:Modify_result_t
   
hitlist:Enumeration_thitlist:Reference_thitlist:Reference_picture_thitlist:Find_Mark_t
1.
  •  
2.
  •  
3.
  • Haghbayan, M. -H, et al. (creator_code:aut_t)
  • MapPro : Proactive runtime mapping for dynamic workloads by quantifying ripple effect of applications on networks-on-chip
  • 2015
  • record:In_t: Proceedings - 2015 9th IEEE/ACM International Symposium on Networks-on-Chip, NOCS 2015. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450333962
  • swepub:Mat_conferencepaper_t (swepub:level_refereed_t)abstract
    • Increasing dynamic workloads running on NoC-based many-core systems necessitates efficient runtime mapping strategies. With an unpredictable nature of application profiles, selecting a rational region to map an incoming application is an NP-hard problem in view of minimizing congestion and maximizing performance. In this paper, we propose a proactive region selection strategy which prioritizes nodes that offer lower congestion and dispersion. Our proposed strategy, MapPro, quantitatively represents the propagated impact of spatial availability and dispersion on the network with every new mapped application. This allows us to identify a suitable region to accommodate an incoming application that results in minimal congestion and dispersion. We cluster the network into squares of different radii to suit applications of different sizes and proactively select a suitable square for a new application, eliminating the overhead caused with typical reactive mapping approaches. We evaluated our proposed strategy over different traffic patterns and observed gains of up to 41% in energy efficiency, 28% in congestion and 21% dispersion when compared to the state-of-the-art region selection methods. Copyright 2015 ACM.
  •  
4.
  • Holsmark, Rickard, 1970- (creator_code:aut_t)
  • Deadlock Free Routing in Mesh Networks on Chip with Regions
  • 2009
  • swepub:Mat_licentiatethesis_t (swepub:level_scientificother_t)abstract
    • There is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structureson silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. Design complexity ofthese Systems on Chip (SoC) is reduced by the use of pre-designed cores. However, several problems related to the interconnection of coresremain. Network on Chip (NoC) is a new SoC design paradigm, which targets the interconnect problems using classical network concepts. Still,SoC cores show large variance in size and functionality, whereas several NoC benefits relate to regularity and homogeneity. This thesis studies some network aspects which are characteristic to NoC systems. One is the issue of area wastage in NoC due to cores of varioussizes. We elaborate on using oversized regions in regular mesh NoC and identify several new design possibilities. Adverse effects of regions oncommunication are outlined and evaluated by simulation. Deadlock freedom is an important region issue, since it affects both the usability and performance of routing algorithms. The concept of faultyblocks, used in deadlock free fault-tolerant routing algorithms has similarities with rectangular regions. We have improved and adopted one suchalgorithm to provide deadlock free routing in NoC with regions. This work also offers a methodology for designing topology agnostic, deadlockfree, highly adaptive application specific routing algorithms. The methodology exploits information about communication among tasks of anapplication. This is used in the analysis of deadlock freedom, such that fewer deadlock preventing routing restrictions are required. A comparative study of the two proposed routing algorithms shows that the application specific algorithm gives significantly higher performance.But, the fault-tolerant algorithm may be preferred for systems requiring support for general communication. Several extensions to our work areproposed, for example in areas such as core mapping and efficient routing algorithms. The region concept can be extended for supporting reuse ofa pre-designed NoC as a component in a larger hierarchical NoC.
  •  
5.
  • O’Nils, Mattias, et al. (creator_code:aut_t)
  • Device driver and DMA controller synthesis from HW /SW communication protocol specifications
  • 2001
  • record:In_t: Design automation for embedded systems. - : Kluwer Academic Publishers. - 0929-5585 .- 1572-8080. ; 6:2, s. 177-205
  • swepub:Mat_article_t (swepub:level_refereed_t)abstract
    • We have separated the information required for HW /SW interface synthesis into three parts, the protocol specification, the operating system related information, and the processor related information. From these inputs a synthesis tool generates (a) device driver functions or (b) a combination of device driver functions and a DMA controller, depending on a designer’s decision. The clean separation of information facilitates (1) efficient design space exploration with combinations of different processors, operating systems and protocols, and (2) maintaining a large number of different versions and variants of HW /SW interfaces by synthesising them on demand. Protocols are specified as a grammar, which is fully independent of architecture and implementation. From this the synthesis tool generates device driver code in C and /or synthesizable RTL code in VHDL for DMA controllers. After the initial selection of implementation alternatives the presented methods are fully automated. Its computational complexity is quadratic in terms of the number of states. With real-life examples we show that the quality of the generated code is close to hand written quality in terms of performance, area and code size.
  •  
6.
  •  
7.
  • Raudvere, Tarvo, et al. (creator_code:aut_t)
  • The ForSyDe semantics
  • 2002
  • record:In_t: Proceedings of Swedish System-on-Chip Conference.
  • swepub:Mat_conferencepaper_t (swepub:level_refereed_t)
  •  
8.
  •  
9.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • navigation:Result_t 1-10 navigation:of_t 356
swepub:Mat_t
swepub:mat_conferencepaper_t (238)
swepub:mat_article_t (66)
swepub:mat_report_t (14)
swepub:mat_chapter_t (14)
swepub:mat_doctoralthesis_t (10)
swepub:mat_licentiatethesis_t (5)
deldatabas:search_more_t
swepub:mat_publicationother_t (3)
swepub:mat_collectioneditorial_t (2)
swepub:mat_book_t (2)
swepub:mat_proceedings_t (1)
swepub:mat_researchreview_t (1)
deldatabas:search_less_t
swepub:Level_t
swepub:level_refereed_t (305)
swepub:level_scientificother_t (51)
swepub:Hitlist_author_t
Lu, Zhonghai (116)
Hemani, Ahmed (44)
Sander, Ingo (40)
Tenhunen, Hannu (39)
Öberg, Johnny (33)
deldatabas:search_more_t
Ellervee, Peeter (22)
O'Nils, Mattias (18)
Kumar, Shashi (17)
Chen, Xiaowen (16)
Millberg, Mikael (16)
Liu, Ming (15)
Chen, Shuming (11)
Svantesson, Bengt (11)
Zhu, Jun (9)
Pamunuwa, Dinesh (9)
Feng, Chaochao (8)
Zheng, Li-Rong (7)
Bjureus, Per (7)
Zhou, Dian (7)
Liu, Shaoteng (7)
Jantsch, Axel, Profe ... (7)
Isoaho, Jouni (7)
Weerasekera, Roshan (6)
Weldezion, Awet Yema ... (6)
Nabiev, Rustam (6)
Liljeberg, Pasi (6)
Liu, Hengzhu (6)
Zhang, Minxuan (6)
Eslami Kiasari, Abba ... (6)
Grange, Matt (6)
Haghbayan, Mohammad- ... (6)
Bertozzi, Davide (5)
Benini, Luca (5)
O'Nils, Mattias, 196 ... (5)
Postula, Adam (5)
Öberg, Johnny (5)
Ebrahimi, Masoumeh (4)
Wang, Qiang (4)
Zheng, Lirong (4)
Al-Khatib, Iyad (4)
Poletti, Francesco (4)
Bechara, Mohamed (4)
Khalifeh, Hasan (4)
Rahmani, Amir M. (4)
Xu, Hao (4)
Li, Jinwen (4)
Forsell, Martti (4)
Soininen, Juha-Pekka (4)
Shallari, Irida (4)
deldatabas:search_less_t
swepub:Hitlist_uni_t
swepub_uni:kth_t (345)
swepub_uni:miun_t (11)
swepub_uni:liu_t (3)
swepub_uni:hj_t (2)
swepub_uni:ri_t (1)
hitlist:Language_t
language:Eng_t (356)
hitlist:HSV_t
hsv:Cat_2_t (290)
hsv:Cat_1_t (56)

hitlist:Year_t

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt tools:Close_t

tools:Permalink_label_t