Parallel scheduling problems in next generation wireless networks

L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, Shanmugavelayutham Muthukrishnan, T. Nandagopal, A. Vitaletti

    Research output: Contribution to conferencePaper

    Abstract

    Next generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two dimensional challenge of assigning both power (rate) and codes for every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next generation wireless data systems. This includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for stream of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, online algorithms for approximating the optimal maximum response time. This relies on resource augmented competitive analysis. We also perform on experimental study with realistic data of channel conditions and user requests to show that our algorithms are more accurate than our worst case analysis shows, and they provide fine-grained QoS to users effectively.

    Original languageEnglish (US)
    Pages238-247
    Number of pages10
    StatePublished - Dec 1 2002
    EventFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada
    Duration: Aug 10 2002Aug 13 2002

    Conference

    ConferenceFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures
    CountryCanada
    CityWinnipeg, MAN.
    Period8/10/028/13/02

    Fingerprint

    Wireless networks
    Scheduling
    Quality of service
    Throughput
    Communication

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Cite this

    Becchetti, L., Diggavi, S., Leonardi, S., Marchetti-Spaccamela, A., Muthukrishnan, S., Nandagopal, T., & Vitaletti, A. (2002). Parallel scheduling problems in next generation wireless networks. 238-247. Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada.

    Parallel scheduling problems in next generation wireless networks. / Becchetti, L.; Diggavi, S.; Leonardi, S.; Marchetti-Spaccamela, A.; Muthukrishnan, Shanmugavelayutham; Nandagopal, T.; Vitaletti, A.

    2002. 238-247 Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada.

    Research output: Contribution to conferencePaper

    Becchetti, L, Diggavi, S, Leonardi, S, Marchetti-Spaccamela, A, Muthukrishnan, S, Nandagopal, T & Vitaletti, A 2002, 'Parallel scheduling problems in next generation wireless networks' Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada, 8/10/02 - 8/13/02, pp. 238-247.
    Becchetti L, Diggavi S, Leonardi S, Marchetti-Spaccamela A, Muthukrishnan S, Nandagopal T et al. Parallel scheduling problems in next generation wireless networks. 2002. Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada.
    Becchetti, L. ; Diggavi, S. ; Leonardi, S. ; Marchetti-Spaccamela, A. ; Muthukrishnan, Shanmugavelayutham ; Nandagopal, T. ; Vitaletti, A. / Parallel scheduling problems in next generation wireless networks. Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada.10 p.
    @conference{a0d430f09ba1491b92e0b90d05f2e038,
    title = "Parallel scheduling problems in next generation wireless networks",
    abstract = "Next generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two dimensional challenge of assigning both power (rate) and codes for every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next generation wireless data systems. This includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for stream of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, online algorithms for approximating the optimal maximum response time. This relies on resource augmented competitive analysis. We also perform on experimental study with realistic data of channel conditions and user requests to show that our algorithms are more accurate than our worst case analysis shows, and they provide fine-grained QoS to users effectively.",
    author = "L. Becchetti and S. Diggavi and S. Leonardi and A. Marchetti-Spaccamela and Shanmugavelayutham Muthukrishnan and T. Nandagopal and A. Vitaletti",
    year = "2002",
    month = "12",
    day = "1",
    language = "English (US)",
    pages = "238--247",
    note = "Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures ; Conference date: 10-08-2002 Through 13-08-2002",

    }

    TY - CONF

    T1 - Parallel scheduling problems in next generation wireless networks

    AU - Becchetti, L.

    AU - Diggavi, S.

    AU - Leonardi, S.

    AU - Marchetti-Spaccamela, A.

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Nandagopal, T.

    AU - Vitaletti, A.

    PY - 2002/12/1

    Y1 - 2002/12/1

    N2 - Next generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two dimensional challenge of assigning both power (rate) and codes for every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next generation wireless data systems. This includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for stream of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, online algorithms for approximating the optimal maximum response time. This relies on resource augmented competitive analysis. We also perform on experimental study with realistic data of channel conditions and user requests to show that our algorithms are more accurate than our worst case analysis shows, and they provide fine-grained QoS to users effectively.

    AB - Next generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two dimensional challenge of assigning both power (rate) and codes for every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next generation wireless data systems. This includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for stream of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, online algorithms for approximating the optimal maximum response time. This relies on resource augmented competitive analysis. We also perform on experimental study with realistic data of channel conditions and user requests to show that our algorithms are more accurate than our worst case analysis shows, and they provide fine-grained QoS to users effectively.

    UR - http://www.scopus.com/inward/record.url?scp=0036948987&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0036948987&partnerID=8YFLogxK

    M3 - Paper

    SP - 238

    EP - 247

    ER -