hh.sePublikasjoner
Endre søk
Begrens søket
1 - 19 of 19
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Hoang Bengtsson, Hoai
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Dynamic Real-time DSP on Manycores2010Konferansepaper (Fagfellevurdert)
  • 2.
    Böhm, Annette
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Kunert, Kristina
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Hoang, Hoai
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    A Fibre-Optic AWG-Based Real-Time Network and Its Applicability to High-Performance Embedded Computing2005Inngår i: 19th International Parallel and Distributed Processing Symposium: proceedings, Piscataway, N.J.: IEEE Press, 2005, s. 133b-133b, artikkel-id 1419972Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, an architecture and a Medium Access Control (MAC) protocol for a multi-wavelength optical communication network, applicable in short range communication systems like System Area Networks (SANs), are proposed. The main focus lies on guaranteed support for hard and soft real-time traffic. The network is based upon a single-hop star topology with an Arrayed Waveguide Grating (AWG) at its center. Traffic scheduling is centralized in one node (residing together with the AWG in a hub), which communicates through a physical control channel. The AWG's property of spatial wavelength reuse and the combination of fixed-tuned and tunable transceivers in the nodes enable simultaneous control and data transmission. A case study with defined real-time communication requirements in the field of Radar Signal Processing (RSP) was carried out and indicates that the proposed system is very suitable for this kind of application.

  • 3.
    Englund, Cristofer
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab). Viktoria Swedish ICT, Gothenburg, Sweden.
    Chen, Lei
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Ploeg, Jeroen
    Netherlands Organization for Applied Scientific Research TNO, Hague, Netherlands.
    Semsar-Kazerooni, Elham
    Netherlands Organization for Applied Scientific Research TNO, Hague, Netherlands.
    Voronov, Alexey
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Hoang Bengtsson, Hoai
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Didoff, Jonas
    Viktoria Swedish ICT, Gothenburg, Sweden.
    The Grand Cooperative Driving Challenge 2016: Boosting the Introduction of Cooperative Automated Vehicles2016Inngår i: IEEE wireless communications, ISSN 1536-1284, E-ISSN 1558-0687, Vol. 23, nr 4, s. 146-152Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The Grand Cooperative Driving Challenge (GCDC), with the aim to boost the introduction of cooperative automated vehicles by means of wireless communication, is presented. Experiences from the previous edition of GCDC, which was held in Helmond in the Netherlands in 2011, are summarized, and an overview and expectations of the challenges in the 2016 edition are discussed. Two challenge scenarios, cooperative platoon merge and cooperative intersection passing, are specified and presented. One demonstration scenario for emergency vehicles is designed to showcase the benefits of cooperative driving. Communications closely follow the newly published cooperative intelligent transport system standards, while interaction protocols are designed for each of the scenarios. For the purpose of interoperability testing, an interactive testing tool is designed and presented. A general summary of the requirements on teams for participating in the challenge is also presented.

  • 4.
    Fan, Xing
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Hoang, Hoai
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Efficient Many-to-Many Real-Time Communication Using an Intelligent Ethernet Switch2004Inngår i: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004 / [ed] D.F. Hsu, K. Hiraki, S. Shen, H. Sudborough, Piscataway, N.J.: IEEE , 2004, s. 280-287Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents a solution for efficient many-to-many communication over switched Ethernet. The performance of using an ordinary switch and an intelligent switch is compared, and the results of the analysis based on 100 Mbit/s fast Ethernet show that an intelligent switch used to handle many-to-many communication can give better performance (shorter latency and higher utilization) than an ordinary switch. We also extend the network to serve many-to-many traffic with real-time demands by adding a thin software layer to the intelligent Ethernet switch and the end-nodes. Earliest deadline first (EDF) scheduling is used.

  • 5.
    Hoang, Hoai
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Enhancing the Performance of Distributed Real-time Systems2007Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Advanced embedded systems can consist of many sensors, actuators and processors that are deployed on one or several boards, while having a demand of interacting with each other and sharing resources. Communication between different components usually has strict timing constraints. There is thus a strong need to provide solutions for time critical communication. This thesis focuses on both the support of real-time services over standard switched Ethernet networks and the improvement of systems' real-time characteristics, such as reducing delay and jitter in processors and on communication links.

    Switched Ethernet has been chosen in this work because of its major advantages in industry; it supports higher bit-rates than most other current LAN (Local Area Network) technologies, including field buses, still at a low cost. We propose using a star network topology with a single Ethernet switch. Each node is connected to a separate port of the switch via a full-duplex link, thereby eliminating collisions. A solid real-time communication protocol for switched Ethernet networks is proposed in the thesis, including a real-time layer between the Ethernet layer and the TCP/IP suite. The network has the capability of supporting both real-time and non real-time traffic and assuring adaptation to the surrounding protocol standards.

    Most embedded systems work in a dynamic environment, where the precise behavior of the network traffic can usually not be predicted. To support real-time services, we have chosen the Earliest Deadline scheduling algorithm (EDF) because of its optimality, high efficiency and suitability for being used in adaptive schemes. To be able to increase the amount of guaranteed real-time traffic, the notion of Asymmetric Deadline Partitioning Scheme (ADPS) is introduced. ADPS allows distribution of the end-to-end deadline of a message, sent from any source node in the network to any destination node via the switch, into two sub-deadlines, one for each hop according to the load of the physical link that it must traverse.

    For the EDF scheduling algorithm, the feasibility test is one of the most important techniques that provides us with information about whether or not the real-time traffic can be guaranteed by the network. With the same computational complexity as the feasibility test, a method has been developed to compute the minimum EDF-feasible deadline for a real-time task. The importance of this method in real-time applications lies in that it can be effectively used to reduce the response times of specific control activities or limit their input-output jitter. To allow more flexibility in the control of delay and jitter in real-time systems, a general approach for reducing task deadlines according to the requirements of individual tasks has been developed. The method allows the user to specify a deadline reduction factor for each task in order to better exploit the available slack according to the tasks' actual requirements.

  • 6.
    Hoang, Hoai
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Real-time communication for industrial embedded systems using switched Ethernet2004Inngår i: 18th International Parallel and Distributed Processing Symposium: Santa Fe, New Mexico, April 26-30, 2004 : proceedings, Los Alamitos, Calif.: IEEE Computer Society , 2004, s. 127-130Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Summary form only given. We give an overview of research on real-time communication over systems area networks (SANs). Our project is focused on developing real-time services for switched Ethernet networks, keeping the Ethernet and TCP/IP Internet communication standards. Switched Ethernet is extended to allow for periodic real-time traffic using earliest deadline first (EDF) scheduling. We have shown the advantage of supporting special communication patterns apparent in industrial and embedded systems. We have made some implementation that demonstrate the support of both guaranteed real-time communication and efficient services for parallel and distributed computer systems by an Ethernet switch with added software.

  • 7.
    Hoang, Hoai
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Switched Real-Time Ethernet for Industrial Applications2003Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    The research reported in this thesis has been focused on developing and analyzing how to support real-time traffic over a switched Ethernet network without any hardware or protocol modifications. The work has resulted in a proposed systems model, supporting both real-time and non real-time traffic. Currently this model is intended for a one-switch network, with no shared media. All added traffic handling to support real-time communication is positioned in a thin layer (RT layer) added between the Ethernet layer and the TCP/IP suite. This assures adaptation to the surrounding protocol standards. The RT layer manages traffic on the basis of virtual connections, denoted as RT channels, as well as packet level scheduling. RT channels are created between end-nodes prior to any occurrence of real-time traffic. Asymmetric deadline partitioning between the links of the RT channels is also proposed, in order to increase the number of possible RT channels.

  • 8.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Bengtsson, Jerker
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    On supporting real-time communication over the IEEE 802.15.4 protocol2008Inngår i: Proceedings of the international conference on wireless information networks and systems (WinSys 2008), Setubal: INSTICC Press, 2008, s. 82-87Konferansepaper (Fagfellevurdert)
    Abstract [en]

    IEEE 802.15.4 is a new enabling technology for low data rate wireless personal networks. This standard was not specifically designed for wireless sensor networks, but it has shown to be a good match with necessary requirements on low data rate, low power consumption and low cost. Unlike the former 802.11 standard, the MAC protocol specified in IEEE 802.15.4 can operate in two different modes: beacon-enabled mode or non-beacon enable mode. In beacon-enabled mode, nodes can exclusively allocate a number of guaranteed time slots, similar to a resource reservation scheme. Hence, the IEEE 802.15.4 MAC protocol have sufficient capabilities for supporting real-time communication. This paper presents the key features of IEEE 802.15.4 which makes it an attractive standard to use for real-time wireless sensor networks. Two real-time protocols extending the IEEE 802.15.4 standard are reviewed. The purpose of this paper is to present the state of the art on real-time support over IEEE 802.15.4 for wireless sensor networks and to discuss the possibilities on improvements on both the standard and the real-time protocols extending the standard.

  • 9.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Buttazzo, Giorgio
    Real-Time Systems Laboratory Scuola Superiore Sant’Anna Pisa, Italy.
    Reducing Delay and Jitter in Software Control Systems2007Inngår i: Proceedings of the 15th International Conference on Real-Time and Network Systems: RTNS’07, Vandoeuvre: Institut National Polytechnique de Lorraine , 2007, s. 173-182Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Software control systems may be subject to high interference caused by concurrency and resource sharing. Reducing delay and jitter in such systems is crucial for guaranteeing high performance and predictability. In this paper, we present a general approach for reducing delay and jitter by acting on task relative deadlines. The method allows the user to specify a deadline reduction factor for each task to better exploit the available slack according to specific jitter sensitivity. Experimental results confirm the effectiveness and the generality of the proposed approach with respect to other methods available in the literature.

  • 10.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Buttazzo, Giorgio
    Real-Time Systems Laboratory Scuola Superiore Sant’Anna Pisa, Italy.
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Reducing delay and jitter in software control systems2007Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Software control systems may be subject to high interference caused by concurrency and resource sharing. Reducing delay and jitter in such systems is crucial for guaranteeing high performance and predictability. In this paper, we present a general approach for reducing delay and jitter by acting on task relative deadlines. The method allows the user to specify a deadline reduction factor for each task to better exploit the available slack according to specific jitter sensitivity. Experimental results confirm the effectiveness and the generality of the proposed approach with respect to other methods available in the literature.

  • 11.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Buttazzo, Giorgio
    Real-Time Systems Laboratory Scuola Superiore Sant’Anna Pisa, Italy.
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Karlsson, Stefan
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Computing the minimum EDF feasible deadline in periodic systems2006Inngår i: 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings, Los Alamitos, Calif.: IEEE Press, 2006, s. 125-134Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible under EDF, the proposed algorithm allows computing the shortest deadline that can be assigned to an arbitrary task in the set, or to a new incoming task (periodic or aperiodic), still preserving the EDF feasibility of the new task set. The algorithm has a pseudo polynomial complexity and handles arbitrary relative deadlines, which can be less than, equal to, or greater than periods.

  • 12.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Real-time communication for industrial embedded systems using switched Ethernet2006Inngår i: ARTES - A network for Real-Time research and graduate Education in Sweden 1997-2006 / [ed] Hans Hansson, Uppsala: Uppsala universitet, 2006, s. 417-427Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    This paper focuses on developing and analyzing support for real-time traffic over a switched Ethernet network without any hardware or protocol modifi- cations. Network architecture with full-duplex switched Ethernet and endnodes has been assumed. The switch and the end nodes control the real-time traffic with Earliest Deadline First (EDF) scheduling on the frame level. No modification to the Ethernet standard is needed in the network that supports both real-time and non-real -time TCP/IP communication. The switch is responsible for admission control where feasibility analysis is made for each link between source and destination. All added traffic handling to support real-time communication is positioned in a thin layer (RT layer) added between the Ethernet layer and the TCP/IP suite. This assures adaptation to the surrounding protocol standards. The RT layer manages traffic on the basis of virtual connections, denoted as RT channels, as well as packet level scheduling. RT channels are created between end-nodes prior to any occurrence of real-time traffic. The comparison of two deadline-partitioning schemes, to partition the delay budget over the links for a path, is also presented. While SDPS (Symmetric Deadline Partitioning Scheme) is straightforward to implement, ADPS (Asymmetric Deadline Partitioning Scheme) is devised in order to have a more flexiblefeasibilitytest. ADPSshows promises in removing bottlenecks from links, especially when a master-slave communication is considered as the traffic pattern, and ADPS proves to be a better choice than SDPS.

  • 13.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Switched Real-Time Ethernet in Industrial Applications - Asymmetric Deadline Partitioning Scheme2003Inngår i: Proc. of the 2nd International Workshop on Real-Time LANs in the Internet Age (RTLIA'2003) in conjunction with the 15th Euromicro Conference on Real-Time Systems, Porto, Portugal, July 1, 2003, 2003, s. 4-Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is introduced. In section 3, the Asymmetric Deadline Partitioning Scheme (ADPS) with the simulation results are presented.

  • 14.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Switched real-time Ethernet in industrial applications - deadline partitioning2003Inngår i: APCC2003: the Ninth Asia-Pacific Conference on Communications : in conjunction with 6th Malaysia International Conference on Communications (MICC03) : 21-24 September, 2003, City Bayview Hotel, Penang, Malaysia / [ed] Mahamod Ismail et al., Piscataway, N.J.: IEEE, 2003, s. 76-81, artikkel-id 1274315Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The scheme is compared with the simpler approach of dividing the deadlines in two (SDPS). The results of several software simulations of setting up RT channels over a full-duplex switched Ethernet network are presented. The simulations show that the ADPS performs better than the SDPS when master-slave communication is assumed over the network.

  • 15.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Hagström, Ulrik
    Kallerdahl, Anders
    Switched real-time Ethernet with earliest deadline first scheduling - protocols and traffic handling2002Inngår i: Proceedings: International Parallel and Distributed Processing Symposium : April 15-19, 2002, Ft. Lauderdale, Florida, USA, Los Alamitos, Calif.: IEEE Computer Society , 2002, s. 94-99, artikkel-id 1016477Konferansepaper (Fagfellevurdert)
    Abstract [en]

    There is a strong interest of using the cheap and simple Ethernet technology for industrial and embedded systems. This far, however, the lack of real-time services has prevented this change of used network technology. This paper presents enhancements to full-duplex switched Ethernet for the ability of giving throughput and delay guarantees. The switch and the end-nodes controls the real-time traffic with Earliest Deadline First (EDF) scheduling on the frame level. No modification to the Ethernet standard is needed in the network that supports both real-time and non-real-time TCP/IP communication. The switch is responsible for admission control where feasibility analysis is made for each link between source and destination. The switch broadcasts Ethernet frames regularly to clock synchronize the end nodes and to implement flow control for non-real-time traffic.

  • 16.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Kallerdahl, Anders
    Hagström, Ulrik
    Switched real-time Ethernet with earliest deadline first scheduling - protocols and traffic handling2002Inngår i: Parallel and Distributed Computing Practices, ISSN 1097-2803, Vol. 5, nr 1, s. 105-115Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    There is a strong interest of using the cheap and simple Ethernet technology for industrial and embedded systems. This far, however, the lack of real-time services has prevented this change of used network technology. This paper presents enhancements to full-duplex switched Ethernet for the ability of giving throughput and delay guarantees. The switch and the end-nodes control the real-time traffic with Earliest Deadline First (EDF) scheduling on the frame level. No modification to the Ethernet standard is needed in the network that supports both real-time and non-real-time TCP/IP communication. The switch is responsible for admission control where feasibility analysis is made for each link between source and destination. The switch broadcasts Ethernet frames regularly to clock synchronize the end nodes and to implement flow control for non-real-time traffic. We have characterized the performance of the network in terms of channel acceptance ratio by simulations with different number of nodes connected to the switch.

  • 17.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Larsson, Anders
    Olsson, Richard
    Bergenhem, Carl
    Deadline first scheduling in switched real-time Ethernet - deadline partitioning issues and software implementation experiments2002Inngår i: Euromicro RTS 2002: 14th Euromicro Conference on Real-Time Systems : proceedings : 19-21 June, 2002, Vienna, Austria, Los Alamitos, Calif.: IEEE Computer Society , 2002, s. 68-71Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents work on a switched Ethernet network extended to allow for earliest deadline first (EDF) scheduling. We show by example that asymmetric deadline partitioning between the links of a real-time channel can increase the utilization substantially, still not violating the real-time guarantees. We also report measurements on a software implementation of the switch on an ordinary PC.

  • 18.
    Hoang, Hoai
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Karlsson, Stefan
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Minimum EDF-feasible deadline calculation with low-time complexity2004Inngår i: RTSS 2004 WIP Proceedings, The 25th IEEE International Real-Time Systems Symposium, Lisbon, Portugal, Dec. 5-8, 2004, 2004Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present a method for calculating the minimum EDF-feasible deadline. The algorithm targets periodic tasks with hard real-time guarantees, that are to be feasibly scheduled with EDF (Earliest Deadline First). The output is the smallest possible deadline required for feasibility, of the task most recently requested. The good thing with our algorithm is that it has the same timecomplexity as the regular EDF feasibility test, when deadlines are not assumed to be equal to the periods of the periodic tasks.

  • 19.
    Svensson, Bertil
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Ul-Abdin, Zain
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Ericsson, Per M.
    Saab AB (EDS), Gothenburg, Sweden.
    Åhlander, Anders
    Saab AB (EDS), Gothenburg, Sweden.
    Hoang Bengtsson, Hoai
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Bengtsson, Jerker
    Saab AB (EDS), Gothenburg, Sweden.
    Gaspes, Veronica
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Nordström, Tomas
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    A Running Leap for Embedded Signal Processing to Future Parallel Platforms2014Inngår i: WISE'14: Proceedings of the 2014 ACM International Workshop on Long-Term Industrial Collaboration on Software Engineering, New York, NY: Association for Computing Machinery (ACM), 2014, s. 35-42Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper highlights the collaboration between industry and academia in research. It describes more than two decades of intensive development and research of new hardware and software platforms to support innovative, high-performance sensor systems with extremely high demands on embedded signal processing capability. The joint research can be seen as the run before a necessary jump to a new kind of computational platform based on parallelism. The collaboration has had several phases, starting with a focus on hardware, then on efficiency, later on software development, and finally on taking the jump and understanding the expected future. In the first part of the paper, these phases and their respective challenges and results are described. Then, in the second part, we reflect upon the motivation for collaboration between company and university, the roles of the partners, the experiences gained and the long-term effects on both sides. Copyright © 2014 ACM.

1 - 19 of 19
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf