Learn More
Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system's requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable(More)
This paper reports on a new interface design. The presentation is similar to a newspaper style, allowing a familiar format and advertisement. In addition, the design includes steps to ease data collection, features to help users influence others in the organization, and a dynamic allocation of menu lists that reflect user's knowledge and previous interest.
Networks with billions of vertices introduce new challenges to perform graph analysis in a reasonable time. Clustering coefficient is an important analytical measure of networks such as social networks and biological networks. To compute clustering coefficient in big graphs, existing distributed algorithms suffer from low efficiency such that they may fail(More)
  • 1