SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Nolte Thomas) srt2:(2012)"

Sökning: WFRF:(Nolte Thomas) > (2012)

  • Resultat 1-10 av 28
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Afshar, Sara, et al. (författare)
  • Resource Sharing under Multiprocessor Semi-Partitioned Scheduling
  • 2012
  • Ingår i: 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'12). - : IEEE. - 9781467330176 - 9780769548241 ; , s. 290-299
  • Konferensbidrag (refereegranskat)abstract
    • Semi-partitioned scheduling has become the subject of recent interest for multiprocessors due to better utilization results, compared to conventional global and partitioned scheduling algorithms. Under semi-partitioned scheduling, a major group of tasks are assigned to fixed processors while a low number of tasks are allocated to more than one processor. Various task assigning techniques have recently been proposed in a semi-partitioned environment. However, a synchronization mechanism for resource sharing among tasks in semi-partitioned scheduling has not yet been investigated. In this paper we propose and evaluate two methods for handling resource sharing under semi-partitioned scheduling in multiprocessor platforms. The main challenge addressed in this paper is to serve the resource requests of tasks that are assigned to different processors.
  •  
2.
  • Afshar, Sara, et al. (författare)
  • Towards Resource Sharing under Multiprocessor Semi-Partitioned Scheduling
  • 2012
  • Ingår i: 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12). - : IEEE. - 9781467326834 - 9781467326858 ; , s. 315-318
  • Konferensbidrag (refereegranskat)abstract
    • Semi-partitioned scheduling has been the subject of recent interest, compared with conventional global and partitioned scheduling algorithms for multiprocessors, due to better utilization results. In semi-partitioned scheduling most tasks are assigned to fixed processors while a low number of tasks are split up and allocated to different processors. Various techniques have recently been proposed to assign tasks in a semi-partitioned environment. However, an appropriate resource sharing mechanism for handling the resource requests between tasks in semi-partitioned scheduling has not yet been investigated. In this paper we propose two methods for handling resource sharing under semi-partitioned scheduling in multiprocessor platforms. The main challenge is to handle the resource requests of tasks that are split over multiple processors.
  •  
3.
  • Ashjaei, Mohammad, et al. (författare)
  • A Compact Approach to Clustered Master-Slave Ethernet Networks
  • 2012
  • Ingår i: IEEE International Workshop on Factory Communication Systems - Proceedings, WFCS. - 9781467315739 ; , s. 157-160
  • Konferensbidrag (refereegranskat)abstract
    • Ethernet switches are increasingly used in real-time distributed systems as a technical solution to guarantee the timeliness in communications. However, there are still limitations related to real-time behavior caused by the limited number of priority levels and the possibility of memory overruns with consequent message losses. These limitations can be eliminated using a master/slave technique such as proposed by the FTT paradigm. This led to the FTT-SE protocol that schedules transmissions centrally in a master node. While this protocol has already been well studied and investigated for small networks with a single switch, its extension to larger networks is still an open issue. In this paper we propose a compact clustered solution to scale the FTT-SE protocol to networks of multiple switches by organizing the network in sub-networks composed of one master and one switch each and which can be connected directly, without bridges. This paper also shows how the timeliness of the traffic can still be enforced. The validation is currently on-going.
  •  
4.
  • Ashjaei, Mohammad, et al. (författare)
  • The Design and Implementation of a Simulator for Switched Ethernet Networks
  • 2012
  • Ingår i: 3rd International Workshop on Analysis Tools andMethodologies for Embeddedand Real-time Systems. ; , s. 57-62
  • Konferensbidrag (refereegranskat)abstract
    • In the context of Switched Ethernet, the Flexible Time-Triggered Switched Ethernet protocol (FTT-SE) was proposed to overcome the limitations and related problems of using COTS switches in real-time networks, such as overflow of switch queues due to uncontrolled arrival of packets. Although the FTT-SE protocol has been validated by several experiments on real applications, evaluation of different architectures as well as evaluation of large scale networks is not straightforward. Therefore, a simulator to evaluate different network architectures based on the FTT-SE protocol is useful. In this paper we present such a simulator. We address the extended FTT-SE protocol using multiple switches and we present a modular simulator based on Simulink/Matlab to visualize message transmissions and to evaluate end-to-end delay bounds of messages.
  •  
5.
  • Ashjaei, Mohammad, et al. (författare)
  • Worst-case delay analysis of master-slave switched ethernet networks
  • 2012
  • Ingår i: Proceeings of the 2nd International Workshop on Worst-Case Traversal Time. - New York, NY, USA : ACM. - 9781450316866 ; , s. 15-21
  • Konferensbidrag (refereegranskat)abstract
    • Switched Ethernet is increasingly used in real-time communication due to its intrinsic features such as micro segmentation and high throughput. However, COTS switches may impose long blocking times due to their FIFO queues and can also experience buffer overflow in outgoing queues due to uncontrolled packets arrival. The FTT-SE protocol uses a Master-Slave technique to overcome the COTS switch limitations in real-time applications. Recently, we extended the protocol for large scale networks and in this paper we present the worst-case delay analysis using the Network Calculus formalism for such a network. Moreover, we assess the end-to-end delay of traffic with simulation concluding that the obtained analytical results present a good match with the observed delays, providing uppers bounds that vary between 0% and 50% above the maximum measured values. © 2012 ACM.
  •  
6.
  • Behnam, Moris, et al. (författare)
  • Multi-core Composability in the Face of Memory Bus Contention
  • 2012
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we describe the problem of achieving composability of independently developed real-time subsystems to be executed on a multicore platform.We evaluate existing work for achieving real-time performance on multicores and illustrate their lack with respect to composability. To better address composability we present a multi-resource server-based scheduling technique to provide predictable performance when composing multiple subsystems on a multicore platform. To achieve composability also on multicore platforms, we propose to add memory-bandwidth as an additional server resource. Tasks within our multi-resource servers are guaranteed both CPU- and memory-bandwidth; thus the performance of a server will become independent of resource usage by tasks in other servers. We are currently implementing multi-resource servers for the Enea’s OSE operating system for a P4080 8-core processor to be tested with software for a 3G-basestation.
  •  
7.
  • Hallmans, Daniel, et al. (författare)
  • Towards using the Graphics Processing Unit (GPU) for Embedded Systems
  • 2012
  • Ingår i: IEEE Symposium on Emerging Technologies and Factory Automation, ETFA 2012. ; , s. Article number: 6489715-
  • Konferensbidrag (refereegranskat)abstract
    • The Graphics Processing Unit (GPU) is becoming a very powerful platform to accelerate graphics and dataparallel compute-intensive applications. It gives a high performance and at the same time it has a low power consumption. This combination is of high performance and low power consumption is useful when it comes to building an embedded system. In this paper we are looking at the possibility to use a combination of CPU and GPU to provide performance metrics that are required in an embedded system. In particular we look at requirements inherent in the process and power industries where we believe that the GPU has the potential to be a useful and natural element in future embedded system architectures.
  •  
8.
  • Iqbal, Zahid, et al. (författare)
  • Implementing Hierarchical Scheduling on COTS Ethernet Switches Using a Master/Slave Approach
  • 2012
  • Ingår i: 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12), Conference proceedings. - 9781467326834 - 9781467326858 ; , s. 76-84
  • Konferensbidrag (refereegranskat)abstract
    • Hierarchical scheduling is instrumental to efficiently deploy component-based designs and achieve composability. It allows partitioning resources into multiple levels, hiding the complexity within each partition behind its respective interface. In this paper we focus on the network resource, particularly on Ethernet using ordinary COTS switches, and we show how hierarchical scheduling can be efficiently deployed using a master/slave approach that enforces the temporal properties of the partitions. We use the FTT-SE protocol for being open source and a bandwidth efficient master/slave alternative currently available for real-time communication over Ethernet. We present a response-time analysis for the traffic submitted within each partition and we validate it using experimental results obtained from a prototype implementation. In particular, the results highlight the strong partitioning capabilities of our approach, with full temporal isolation across partitions in different branches of the hierarchy.
  •  
9.
  • Khalilzad, Nima, et al. (författare)
  • Bandwidth Adaptation in Hierarchical Scheduling Using Fuzzy Controllers
  • 2012
  • Ingår i: 7th IEEE International Symposium on Industrial Embedded Systems, SIES 2012 - Conference Proceedings. - : IEEE Press. - 9781467326841 ; , s. 148-157
  • Konferensbidrag (refereegranskat)abstract
    • In our previous work, we have introduced an adaptive hierarchical scheduling framework as a solution for composing dynamic real-time systems, i.e., systems where the CPU demand of their tasks are subjected to unknown and potentially drastic changes during run-time. The framework uses the PI controller which periodically adapts the system to the current load situation. The conventional PI controller despite simplicity and low CPU overhead, provides acceptable performance. However, increasing the pressure on the controller e.g, with an application consisting of multiple tasks with drastically oscillating execution times, degrades the performance of the PI controller. Therefore, in this paper we modify the structure of our adaptive framework by replacing the PI controller with a fuzzy controller to achieve better performance. Furthermore, we conduct a simulation based case study in which we compose dynamic tasks such as video decoder tasks with a set of static tasks into a single system, and we show that the new fuzzy controller outperforms our previous PI controller.
  •  
10.
  • Kienle, Holger, et al. (författare)
  • System-specific static code analyses : a case study in the complex embedded systems domain
  • 2012
  • Ingår i: Software quality journal. - : Springer Science and Business Media LLC. - 0963-9314 .- 1573-1367. ; 20:2, s. 337-367
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we are exploring the approach to utilize system-specific static analyses of code with the goal to improve software quality forspecific software systems. Specialized analyses, tailored for a particular system, make it possible to take advantage of system/domainknowledge that is not available to more generic analyses. Furthermore, analyses can be selected and/or developed in order to best meet the challenges and specific issues of the system at hand. As a result, such analyses can be used as a complement to more generic code analysistools because they are likely to have a better impact on (business) concerns such as improving certain software quality attributes and reducing certain classes of failures. We present a case study of a large, industrial embedded system, giving examples of what kinds of analyses could be realized and demonstrate the feasibility of implementing such analyses. We synthesize lessons learned based on our case study and provide recommendations on how to realize system-specific analyses and how to get them adopted by industry.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 28

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 Stäng

Kopiera och spara länken för att återkomma till aktuell vy