IEEE CS Press Research Articles

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press

New Title from IEEE CS Press

New Title from IEEE CS Press [advertisement

New Title from IEEE CS Press [advertisement

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press House Advertisement

New Title from IEEE CS Press

New Title from IEEE CS Press

On Core XPath with Inflationary Fixed Points

We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, inProc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002).IEEE CS Press (2002) 189–202.] extended with anInflationary Fixed Point (IFP)operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only theselfanddescendantaxes is already undecidable.

Advertisement - New title from Wiley & IEEE CS Press

Advertisement - New title from Wiley & IEEE CS Press

IEEE CS Press Too Soon to Tell

IEEE CS Press Too Soon to Tell

IEEE CS Press house advertisement

IEEE CS Press house advertisement

New Title from Wiley and IEEE CS Press

New Title from Wiley and IEEE CS Press

IEEE CS Press house advertisement

IEEE CS Press house advertisement

The psi-cube: a bus-based cube-type clustering network for high-performance on-chip systems

This paper proposes a bus-based cube-type network, called psi-cube, that alleviates the two problems, long wires and a limited number of I/O pins, against the on-chip systems through a small diameter and dynamic clusters, respectively. The 2 n -node psi-cube is organized on the sets of node-partitions produced with an extended n-bit Hamming code ψ( n, k) [M. Takesue, Ψ-Cubes: recursive bused fat-hypercubes for multilevel snoopy caches, in: Proceedings of the International Symposium on Parallel Architectures, Algorithms, and Networks, IEEE CS Press, 1999, pp. 62–67] if we connect the nodes in each partition to the bus owned by the leader of the partition. Owing to the routing between the leaders separated by the distance of 1–3, the diameter equals ⌊ n/2⌋ if n≠2 p − 1 or ⌈ n/2⌉ otherwise. The maximum bus length is O(2 p−1 ) or O(2 k−1 ) when the psi-cube is mapped onto an array. We dynamically produce separate sets of clusters for different off-chip targets such as memory blocks, so the traffic to the leaders of clusters is much smaller than in static clusters fixed in hardware. From simulation results, the psi-cube outperforms over the mesh if the bus delay is less than 4 times the mesh link’s, and the dynamic clusters increase the psi-cube bandwidth by over 60%.

A Framework for using benefit functions in complex real-time systems

Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real-time systems [1, 2, 3]. While the future of real-time computing research and practice will likely exploit the utility of benefit-based models, this will not occur until a suitable system level benefit framework has been defined. This paper provides an overview of ongoing work to develop such an initial framework that can formalize the use of benefit functions in complex real-time systems. It is easily shown that this framework can support traditional hard/firm/soft real-time paradigms as well as support newer proposed models for future real-time operation [4, 5]. We also show that our proposed framework unifies composition of benefit values derived from heterogeneous perspectives, including those derived from the application perspective. [1] E. D. Jensen, C. D. Locke and H. Tokuda, A Time-Driven Scheduling Model for Real-Time Operating Systems, in Proceedings of the IEEE Real-Time Systems Symposium, pp. 112–122, IEEE CS Press, 1985. [2] S. A. Brandt and G. J. Nutt, Flexible Soft Real-Time Processing in Middleware, in Journal of Real-Time Systems, Kluwer, 22(1,2):77–118, January–March 2002. [3] L. R. Welch, B. Ravindran, B. Shirazi and C. Bruggeman, Specification and analysis of dynamic, distributed real-time systems, in Proceedings of the IEEE Real-Time Systems Symposium, pp. 72–81, IEEE CS Press, 1998. [4] E. Lee, What's Ahead for Embedded Software? in IEEE Computer, pp. 18–26, Sept. 2000. [5] J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler and K. Pister, System Architecture Directions for Networked Sensors, in Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IX), pp. 93–104, Nov. 2000.